Proof of the 1-Factorization and Hamilton Decomposition Conjectures |
|
| Author:
| Csaba, Bela
Kuhn, Daniela
Lo, Allan
Osthus, Deryk
Treglown, Andrew |
| Series title: | Memoirs of the American Mathematical Society Ser. |
| ISBN: | 978-1-4704-2025-3 |
| Publication Date: | Oct 2016 |
| Publisher: | American Mathematical Society
|
| Book Format: | Paperback |
| List Price: | USD $90.00USD $90.00 |
Book Description:
|
In this paper the authors prove the following results for all sufficiently large $n$: [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$; [Hamilton decomposition conjecture] Suppose that $D \ge \lfloor n/2 \rfloor $; [Optimal packings of Hamilton cycles] Suppose that $G$ is a graph on $n$ vertices with minimum degree $\delta\ge n/2$.
In this paper the authors prove the following results for all sufficiently large $n$: [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$; [Hamilton decomposition conjecture] Suppose that $D \ge \lfloor n/2 \rfloor $; [Optimal packings of Hamilton cycles] Suppose that $G$ is a graph on $n$ vertices with minimum degree $\delta\ge n/2$.