Proof of Komlós's conjecture on Hamiltonian subsets

Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph K d+1 minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when d is sufficiently large. In fact we prove a...

Descripció completa

Dades bibliogràfiques
Autors principals: Kim, J, Liu, H, Sharifzadeh, M, Staden, K
Format: Journal article
Publicat: London Mathematical Society 2017

Ítems similars