Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree

DOI10.1017/S0963548312000569zbMath1269.05068arXiv1211.3263OpenAlexW2963797887MaRDI QIDQ4921569

John Lapinskas, Deryk Osthus, Daniela Kühn

Publication date: 13 May 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

packingsHamiltonian cyclesminimum degreelargest even-regular spanning subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ A Rainbow Dirac's Theorem ⋮ Random directed graphs are robustly Hamiltonian ⋮ Edge-disjoint Hamilton cycles in random graphs ⋮ Decomposing hypergraphs into cycle factors

Cites Work

• Edge-disjoint Hamilton cycles in graphs
• Hamiltonian degree sequences in digraphs
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Some Theorems on Abstract Graphs
• The Factors of Graphs

This page was built for publication: Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree