Sharp Threshold for Hamiltonicity of Random Geometric Graphs

DOI10.1137/060665300zbMath1144.05060arXivcs/0607023OpenAlexW2064125955WikidataQ57991467 ScholiaQ57991467MaRDI QIDQ5454260

Xavier Pérez, Dieter Mitsche, Josep Diaz

Publication date: 28 March 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0607023

zbMATH Keywords

Hamilton cyclesrandom geometric graphs

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items

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, Hamilton cycles in random geometric graphs, Sharp thresholds for Hamiltonicity in random intersection graphs, Disjoint Hamilton cycles in the random geometric graph