HAMILTON CYCLES IN RANDOM GEOMETRIC GRAPHS

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 Penrose. We also show that in the k-nearest neighbour model, there is a

[1]  Béla Bollobás,et al.  Highly connected random geometric graphs , 2009, Discret. Appl. Math..

[2]  B. Bollobás,et al.  A critical constant for the k nearest-neighbour model , 2007, Advances in Applied Probability.

[3]  B. Bollobás.  The art of mathematics : coffee time in Memphis , 2006 .

[4]  Josep Díaz,et al.  Sharp threshold for hamiltonicity of random geometric graphs , 2006, SIAM J. Discret. Math..

[5]  B. Bollobás,et al.  Connectivity of random k-nearest-neighbour graphs , 2005, Advances in Applied Probability.

[6]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[7]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  M. Penrose.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[9]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[10]  János Komlós,et al.  Limit distribution for the existence of Hamiltonian cycles in a random graph , 2006, Discret. Math..

[11]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..