Proof Of The 1 Factorization And Hamilton Decomposition Conjectures
Download and Read Proof Of The 1 Factorization And Hamilton Decomposition Conjectures full books in PDF, ePUB, and Kindle. Read online free Proof Of The 1 Factorization And Hamilton Decomposition Conjectures ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Proof of the 1-Factorization and Hamilton Decomposition Conjectures
Author | : Béla Csaba |
Publisher | : American Mathematical Soc. |
Total Pages | : 176 |
Release | : 2016-10-05 |
Genre | : Mathematics |
ISBN | : 1470420252 |
Download Proof of the 1-Factorization and Hamilton Decomposition Conjectures Book in PDF, Epub and Kindle
In this paper the authors prove the following results (via a unified approach) for all sufficiently large n: (i) [1-factorization conjecture] Suppose that n is even and D≥2⌈n/4⌉−1. Then every D-regular graph G on n vertices has a decomposition into perfect matchings. Equivalently, χ′(G)=D. (ii) [Hamilton decomposition conjecture] Suppose that D≥⌊n/2⌋. Then every D-regular graph G on n vertices has a decomposition into Hamilton cycles and at most one perfect matching. (iii) [Optimal packings of Hamilton cycles] Suppose that G is a graph on n vertices with minimum degree δ≥n/2. Then G contains at least regeven(n,δ)/2≥(n−2)/8 edge-disjoint Hamilton cycles. Here regeven(n,δ) denotes the degree of the largest even-regular spanning subgraph one can guarantee in a graph on n vertices with minimum degree δ. (i) was first explicitly stated by Chetwynd and Hilton. (ii) and the special case δ=⌈n/2⌉ of (iii) answer questions of Nash-Williams from 1970. All of the above bounds are best possible.
Proof of the 1-Factorization and Hamilton Decomposition Conjectures Related Books
Pages: 176
Pages:
Pages: 612
Pages: 875
Pages: 365