• set graphs. iii. proof pearl: claw-free graphs mirrored into transitive hereditarily finite sets

    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 624
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     we report on the formalization of two classical results about claw-free graphs, which have been verified correct by jacob t. schwartz’s proof-checker referee. we have proved formally that every connected claw-free graph admits (1) a near-perfect matching, (2) hamiltonian cycles in its square. to take advantage of the set-theoretic foundation of referee, we exploited set equivalents of the graph-theoretic notions involved in our experiment: edge, source, square, etc. to ease some proofs, we have often resorted to weak counterparts of well-established notions such as cycle, claw-freeness, longest directed path, etc.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها