Hamiltonian circuits in random graphs

Abstract

The probability that a random graph with n vertices and cn log n edges contains a Hamiltonian circuit tends to 1 as n → ∞ (if c is sufficiently large). © 1976.