Proof of Komlós's conjecture on Hamiltonian subsets

DOI10.1016/j.endm.2017.07.029zbMath1379.05064arXiv1701.06784OpenAlexW2742183445WikidataQ122945739 ScholiaQ122945739MaRDI QIDQ1689999

Hong Liu, Katherine Staden, Maryam Sharifzadeh, Jae-Hoon Kim

Publication date: 18 January 2018

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

expansionHamiltonian cyclesHamiltonian cyclecomplete graphextremal graph theoryvertex degreeblow-up methodHamiltonian subset

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Well-mixing vertices and almost expanders ⋮ Crux and Long Cycles in Graphs ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Nested cycles with no geometric crossings ⋮ Ramsey numbers of cycles versus general graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problems on cycles and colorings
• Triangle-free graphs with the maximum number of cycles
• Hamiltonian cycles in Dirac graphs
• Blow-up lemma
• Estimations for the number of cycles in a graph
• On the number of cycles in 3-connected cubic graphs
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Subdivisions of a large clique in \(C_6\)-free graphs
• Hamilton decompositions of regular expanders: applications
• Topological Cliques in Graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Topological cliques in graphs II
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Reducibility among Combinatorial Problems
• Logarithmically small minors and topological minors
• Edge-disjoint Hamilton cycles in random graphs
• A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
• Local Conditions for Exponentially Many Subdivisions
• Some Theorems on Abstract Graphs

This page was built for publication: Proof of Komlós's conjecture on Hamiltonian subsets