How Many Random Edges Make a Dense Graph Hamiltonian?

Random Structures and Algorithms

Volumn 22, Issue 1, 2003, Pages 33-42

  Bohman, Tom ^a   Frieze, Alan ^a   Martin, Ryan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037232181     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10070     Document Type: Article

References (7)

1. B. Bollobás, Random graphs, Academic Press, New York, 1985.
2. V. Chvátal and P. Erdos, A note on Hamiltonian circuits, Discrete Math 2 (1972), 111-113.
3. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hung Acad Sci 5 (1960), 17-61; Discrete Math 45 (1983), 301-305.
4. P. Erdo″s and A. Rényi, On the evolution of random graphs, Publ Math Inst Hung Acad Sci 5 (1960), 17-61; Discrete Math 45 (1983), 301-305.
5. A. Ghouila-Houri, Une condition suffisante d'existance d'un circuit hamiltonien, C R Acad Sci Paris 25 (1960), 495-497.
6. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley-Interscience, New York, 2000.
7. L. Pósa, Hamiltonian circuits in random graphs, Discrete Math 14 (1976), 359-364.