Hamilton cycles in 3-out

Abstract

Let G3-outdenote the random graph on vertex set [n] in which each vertex chooses three neighbors uniformly at random. Note that G3-out has minimum degree 3 and average degree 6. We prove that the probability that G3-out is Hamiltonian goes to 1 as n tends to infinity. © 2009 Wiley Periodicals, Inc.