Mathematics – Combinatorics
Scientific paper
2009-07-26
Mathematics
Combinatorics
Scientific paper
We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of lengths taken in the l_p norm. We show that the first edge that makes the random geometric graph Hamiltonian is a.a.s. exactly the same one that gives 2-connectivity. We also extend this result to arbitrary connectivity, by proving that the first edge in the process that creates a k-connected graph coincides a.a.s. with the first edge that causes the graph to contain k/2 pairwise edge-disjoint Hamilton cycles (for even k), or (k-1)/2 Hamilton cycles plus one perfect matching, all of them pairwise edge-disjoint (for odd k).
Perez-Gimenez Xavier
Wormald Nicholas C.
No associations
LandOfFree
Disjoint Hamilton cycles in the random geometric graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Disjoint Hamilton cycles in the random geometric graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disjoint Hamilton cycles in the random geometric graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-357204