Proof of Komlós's conjecture on Hamiltonian subsets
From MaRDI portal
Publication:1689999
DOI10.1016/j.endm.2017.07.029zbMath1379.05064arXiv1701.06784WikidataQ122945739 ScholiaQ122945739MaRDI QIDQ1689999
Hong Liu, Maryam Sharifzadeh, Katherine Staden, 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
expansion; Hamiltonian cycles; Hamiltonian cycle; complete graph; extremal graph theory; vertex degree; blow-up method; Hamiltonian subset
05C35: Extremal problems in graph theory
05C30: Enumeration in graph theory
05C38: Paths and cycles
05C45: Eulerian and Hamiltonian graphs