Hamilton cycles in random geometric graphs
From MaRDI portal
Publication:549867
DOI10.1214/10-AAP718zbMath1222.05235arXiv0905.4650OpenAlexW3102719874MaRDI QIDQ549867
József Balogh, Mark Walters, Michael Krivelevich, Béla Bollobás, Tobias Müller
Publication date: 19 July 2011
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.4650
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (13)
Connectivity of soft random geometric graphs ⋮ Getting a Directed Hamilton Cycle Two Times Faster ⋮ Hitting Time Theorems for Random Matrices ⋮ On the contractibility of random Vietoris-Rips complexes ⋮ A geometric Achlioptas process ⋮ Hamiltonicity of graphs perturbed by a random geometric graph ⋮ Bridged Hamiltonian cycles in sub-critical random geometric graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Perfect matchings and Hamiltonian cycles in the preferential attachment model ⋮ Clustering and the Hyperbolic Geometry of Complex Networks ⋮ Topology-hiding computation on all graphs ⋮ On the treewidth of random geometric graphs and percolated grids ⋮ The acquaintance time of (percolated) random geometric graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Highly connected random geometric graphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Hamiltonian circuits in random graphs
- The longest edge of the random minimal spanning tree
- Approximating Layout Problems on Random Geometric Graphs
- A critical constant for the k nearest-neighbour model
- Random Geometric Graphs
- Connectivity of random k-nearest-neighbour graphs
- Sharp Threshold for Hamiltonicity of Random Geometric Graphs
This page was built for publication: Hamilton cycles in random geometric graphs