Proof of the $1$-factorization and Hamilton Decomposition Conjectures

zbMath1291.05154arXiv1401.4159MaRDI QIDQ5420009

Deryk Osthus, Andrew Treglown, Béla Csaba, Allan Lo, Daniela Kühn

Publication date: 11 June 2014

Full work available at URL: https://arxiv.org/abs/1401.4159

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Hamilton cycles in sparse robustly expanding digraphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ On the number of disjoint perfect matchings of regular graphs with given edge connectivity

This page was built for publication: Proof of the $1$-factorization and Hamilton Decomposition Conjectures