Hamilton cycles in random geometric graphs

József Balogh, Béla Bollobás, Michael Krivelevich +2

We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This answers a question of Penro…