Proof of the 1-Factorization and Hamilton Decomposition Conjectures

@inproceedings{Csaba2013ProofOT,
  title={Proof of the 1-Factorization and Hamilton Decomposition Conjectures},
  author={B{\'e}la Csaba and Daniela K{\"u}hn and Allan Lo and Deryk Osthus and Andrew Treglown},
  year={2013}
}
In this paper we 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 thatD ≥ 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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, Studies in Pure Mathematics (Presented to Richard Rado)

  • C. St. J.A. Nash-Williams
  • 1971
Highly Influential
8 Excerpts

Hamiltonian arcs and circuits

  • C. St. J.A. Nash-Williams
  • Recent Trends in Graph Theory (Proc. Conf., New…
  • 1970
Highly Influential
7 Excerpts

Hamiltonian lines in graphs whose vertices have sufficiently large valencies, Combinatorial theory and its applications, III (Proc

  • C. St. J.A. Nash-Williams
  • Colloq., Balatonfüred,
  • 1969
Highly Influential
8 Excerpts

Valency sequences which force graphs to have Hamiltonian circuits

  • C.St.J.A. Nash-Williams
  • University of Waterloo Research Report,
  • 1969
Highly Influential
8 Excerpts

Tipnis, All regular multigraphs of even order and high degree are 1-factorable, Electron

  • Michael J. Plantholt, K Shailesh
  • J. Combin
  • 2001
Highly Influential
1 Excerpt

Minimum degree of a graph and the existence of k-factors

  • P. Katerinis
  • Proc. Indian Acad. Sci. Math. Sci
  • 1985
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…