Hamiltonian cycles in random regular graphs (Q1063002)

It is shown that if r is a sufficiently large (\(\geq 796)\) constant, then the proportion of (vertex-labelled) r-regular random graphs which are Hamiltonian tends to 1 as \(n\to \infty\). The proof is based on using 'Pósa transforms' together with an elegant 'colouring' argument. Essentially the same result is given independently in \textit{B. Bollobás}, 'Almost all regular graphs are Hamiltonian', Eur. J. Comb. 4, 97-106 (1983; Zbl 0513.05048).