AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Proof of the $1$-factorization and Hamilton Decomposition Conjectures
About this Title
Béla Csaba, Bolyai Institute, University of Szeged, H-6720 Szeged, Aradi vértanúk tere 1. Hungary, Daniela Kühn, School of Mathematics University of Birmingham Edgbaston Birmingham B15 2TT UK, Allan Lo, School of Mathematics University of Birmingham Edgbaston Birmingham B15 2TT UK, Deryk Osthus, School of Mathematics University of Birmingham Edgbaston Birmingham B15 2TT UK and Andrew Treglown, School of Mathematics University of Birmingham Edgbaston Birmingham B15 2TT UK
Publication: Memoirs of the American Mathematical Society
Publication Year:
2016; Volume 244, Number 1154
ISBNs: 978-1-4704-2025-3 (print); 978-1-4704-3508-0 (online)
DOI: https://doi.org/10.1090/memo/1154
Published electronically: June 21, 2016
Keywords: 1-factorization,
Hamilton cycle,
Hamilton decomposition
MSC: Primary 05C70, 05C45
Table of Contents
Chapters
- 1. Introduction
- 2. The two cliques case
- 3. Exceptional systems for the two cliques case
- 4. The bipartite case
- 5. Approximate decompositions
Abstract
In this paper we prove the following results (via a unified approach) for all sufficiently large $n$:
-
[$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into perfect matchings. Equivalently, $\chi ’(G)=D$.
-
[Hamilton decomposition conjecture] Suppose that $D \ge \lfloor n/2 \rfloor$. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into Hamilton cycles and at most one perfect matching.
-
[Optimal packings of Hamilton cycles] Suppose that $G$ is a graph on $n$ vertices with minimum degree $\delta \ge n/2$. Then $G$ contains at least $\textrm {reg}_\textrm {even}(n,\delta )/2 \ge (n-2)/8$ edge-disjoint Hamilton cycles. Here $\mathrm {reg}_{\mathrm {even}}(n,\delta )$ denotes the degree of the largest even-regular spanning subgraph one can guarantee in a graph on $n$ vertices with minimum degree $\delta$.
(i) was first explicitly stated by Chetwynd and Hilton. (ii) and the special case $\delta = \lceil n/2 \rceil$ of (iii) answer questions of Nash-Williams from 1970. All of the above bounds are best possible.
- Renu Laskar and Bruce Auerbach, On decomposition of $r$-partite graphs into edge-disjoint Hamilton circuits, Discrete Math. 14 (1976), no. 3, 265–268. MR 389662, DOI 10.1016/0012-365X(76)90039-X
- D. Cariolaro, The 1-factorization problem and some related conjectures, Ph. D. Thesis, University of Reading, 2004.
- A. G. Chetwynd and A. J. W. Hilton, Regular graphs of high degree are $1$-factorizable, Proc. London Math. Soc. (3) 50 (1985), no. 2, 193–206. MR 772711, DOI 10.1112/plms/s3-50.2.193
- A. G. Chetwynd and A. J. W. Hilton, Star multigraphs with three vertices of maximum degree, Math. Proc. Cambridge Philos. Soc. 100 (1986), no. 2, 303–317. MR 848854, DOI 10.1017/S030500410006610X
- A. G. Chetwynd and A. J. W. Hilton, $1$-factorizing regular graphs of high degree—an improved bound, Discrete Math. 75 (1989), no. 1-3, 103–112. Graph theory and combinatorics (Cambridge, 1988). MR 1001390, DOI 10.1016/0012-365X(89)90082-4
- Demetres Christofides, Daniela Kühn, and Deryk Osthus, Edge-disjoint Hamilton cycles in graphs, J. Combin. Theory Ser. B 102 (2012), no. 5, 1035–1060. MR 2959389, DOI 10.1016/j.jctb.2011.10.005
- A. Ferber, M. Krivelevich and B. Sudakov, Counting and packing Hamilton cycles in dense graphs and oriented graphs, J. Combin. Theory B, to appear.
- A. Ferber, M. Krivelevich and B. Sudakov, Counting and packing Hamilton $\ell$-cycles in dense hypergraphs, Journal of Combinatorics 7 (2016), 135–157.
- Alan Frieze and Michael Krivelevich, On packing Hamilton cycles in $\epsilon$-regular graphs, J. Combin. Theory Ser. B 94 (2005), no. 1, 159–172. MR 2130284, DOI 10.1016/j.jctb.2004.12.003
- S.G. Hartke, R. Martin and T. Seacrest, Relating minimum degree and the existence of a $k$-factor, research manuscript.
- Stephen G. Hartke and Tyler Seacrest, Random partitions and edge-disjoint Hamiltonian cycles, J. Combin. Theory Ser. B 103 (2013), no. 6, 742–766. MR 3127592, DOI 10.1016/j.jctb.2013.09.004
- Ian Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981), no. 4, 718–720. MR 635430, DOI 10.1137/0210055
- Bill Jackson, Edge-disjoint Hamilton cycles in regular graphs of large degree, J. London Math. Soc. (2) 19 (1979), no. 1, 13–16. MR 527728, DOI 10.1112/jlms/s2-19.1.13
- Svante Janson, Tomasz Łuczak, and Andrzej Rucinski, Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000. MR 1782847
- P. Katerinis, Minimum degree of a graph and the existence of $k$-factors, Proc. Indian Acad. Sci. Math. Sci. 94 (1985), no. 2-3, 123–127. MR 844252, DOI 10.1007/BF02880991
- Jeong Han Kim and Nicholas C. Wormald, Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs, J. Combin. Theory Ser. B 81 (2001), no. 1, 20–44. MR 1809424, DOI 10.1006/jctb.2000.1991
- F. Knox, D. Kühn and D. Osthus, Edge-disjoint Hamilton cycles in random graphs, Random Structures Algorithms 46 (2015), 397–445.
- Michael Krivelevich and Wojciech Samotij, Optimal packings of Hamilton cycles in sparse random graphs, SIAM J. Discrete Math. 26 (2012), no. 3, 964–982. MR 3022117, DOI 10.1137/110849171
- Daniela Kühn, John Lapinskas, and Deryk Osthus, Optimal packings of Hamilton cycles in graphs of high minimum degree, Combin. Probab. Comput. 22 (2013), no. 3, 394–416. MR 3053854, DOI 10.1017/S0963548312000569
- D. Kühn, A. Lo, D. Osthus and K. Staden, The robust component structure of dense regular graphs and applications, Proc. London Math. Soc. 110 (2015), 19–56.
- Daniela Kühn and Deryk Osthus, Hamilton decompositions of regular expanders: a proof of Kelly’s conjecture for large tournaments, Adv. Math. 237 (2013), 62–146. MR 3028574, DOI 10.1016/j.aim.2013.01.005
- Daniela Kühn and Deryk Osthus, Hamilton decompositions of regular expanders: applications, J. Combin. Theory Ser. B 104 (2014), 1–27. MR 3132742, DOI 10.1016/j.jctb.2013.10.006
- D. Kühn and D. Osthus, Hamilton cycles in graphs and hypergraphs: an extremal perspective, Proceedings of the ICM 2014, Seoul, Korea, Vol. 4, 381–406.
- Daniela Kühn, Deryk Osthus, and Andrew Treglown, Hamilton decompositions of regular tournaments, Proc. Lond. Math. Soc. (3) 101 (2010), no. 1, 303–335. MR 2661248, DOI 10.1112/plms/pdp062
- Daniela Kühn, Deryk Osthus, and Andrew Treglown, Hamiltonian degree sequences in digraphs, J. Combin. Theory Ser. B 100 (2010), no. 4, 367–380. MR 2644240, DOI 10.1016/j.jctb.2009.11.004
- E. Lucas, Récréations Mathématiques, Vol. 2, Gautheir-Villars, 1892.
- C.St.J.A. Nash-Williams, Valency sequences which force graphs to have Hamiltonian circuits, University of Waterloo Research Report, Waterloo, Ontario, 1969.
- C. St. J. A. Nash-Williams, Hamiltonian lines in graphs whose vertices have sufficiently large valencies, Combinatorial theory and its applications, III (Proc. Colloq., Balatonfüred, 1969) North-Holland, Amsterdam, 1970, pp. 813-819. MR 0299517
- C. St. J. A. Nash-Williams, Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, Studies in Pure Mathematics (Presented to Richard Rado), Academic Press, London, 1971, pp. 157–183. MR 0284366
- C. St. J. A. Nash-Williams, Hamiltonian arcs and circuits, Recent Trends in Graph Theory (Proc. Conf., New York, 1970) Lecture Notes in Mathematics, Vol. 186, Springer, Berlin, 1971, pp. 197–210. MR 0277417
- Deryk Osthus and Katherine Staden, Approximate Hamilton decompositions of robustly expanding regular digraphs, SIAM J. Discrete Math. 27 (2013), no. 3, 1372–1409. MR 3090152, DOI 10.1137/120880951
- L. Perkovic and B. Reed, Edge coloring regular graphs of high degree, Discrete Math. 165/166 (1997), 567–578. Graphs and combinatorics (Marseille, 1995). MR 1439301, DOI 10.1016/S0012-365X(96)00202-6
- Michael J. Plantholt and Shailesh K. Tipnis, All regular multigraphs of even order and high degree are 1-factorable, Electron. J. Combin. 8 (2001), no. 1, Research Paper 41, 8. MR 1877660
- Michael Stiebitz, Diego Scheide, Bjarne Toft, and Lene M. Favrholdt, Graph edge coloring, Wiley Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2012. Vizing’s theorem and Goldberg’s conjecture; With a preface by Stiebitz and Toft. MR 2975974
- E. R. Vaughan, An asymptotic version of the multigraph 1-factorization conjecture, J. Graph Theory 72 (2013), no. 1, 19–29. MR 2993074, DOI 10.1002/jgt.21629
- V. G. Vizing, Critical graphs with given chromatic class, Diskret. Analiz 5 (1965), 9–17 (Russian). MR 200202
- D.B. West, Introduction to Graph Theory (2nd Edition), Pearson 2000.