Past exam of the probability, statistics and options I course of the University of Oxford / 2007 / R / 1 / ii

True. Label the vertices $1,\dots ,n$. The cycle $1,2,\dots ,n,1$ uses existing edges of the complete graph and visits every vertex once before returning. It is a Hamiltonian cycle for every $n\ge 3$.