Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs

Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden

Published 2014-02-19, updated 2016-02-04Version 2

We prove that, for large $n$, every $3$-connected $D$-regular graph on $n$ vertices with $D \geq n/4$ is Hamiltonian. This is best possible and confirms a conjecture posed independently by Bollob\'as and H\"aggkvist in the 1970s. The proof builds on a structural decomposition result proved recently by the same authors.