Hamilton cycles in 3-out

Random Structures and Algorithms

Volumn 35, Issue 4, 2009, Pages 393-417

  Bohman, Tom ^a   Frieze, Alan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

3 out; Hamilton cycles; Random graphs

Indexed keywords

EID: 70350545478     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20272     Document Type: Article

References (16)

1. M. Ajtai, J. Komlós, and E. Szemerédi, The first occurrence of Hamilton cycles in random graphs, Ann Discrete Math 27 (1985), 173-178.
2. N. Alon and J. Spencer, The probabilistic method, Wiley, New Jersey, 1992.
3. B. Bollobás, The evolution of sparse graphs, In B. Bolloba ́s, editor, Graph theory and combinatorics, (Proceedings of the Cambridge Combinatorics Conference in Honour of Paul Erdo{double acute}s), Academic Press, 1984, pp. 35-57.
4. B. Bollobás and A. M. Frieze, On matchings and hamiltonian cycles in random graphs, Ann Discrete Math 28 (1985), 23-46.
5. B. Bollobás, T. I. Fenner, and A. M. Frieze, Hamilton cycles in random graphs with minimal degree at least k, A tribute to Paul Erdo{double acute}s, A. Baker, B. Bollobás, and A. Hajnal, editors, Cambridge University Press, Cambridge, 1990, pp. 59-96.
6. C. Cooper and A. M. Frieze, Hamilton cycles in random graphs and directed graphs, Random Struct Algorithms 16 (2000), 369-401.
7. C. Cooper, A. M. Frieze, and B. Reed, Random regular graphs of non-constant degree: Connectivity and Hamilton cycles, Combinatorics Probability Comput 11 (2002), 249-262.
8. T. I. Fenner and A. M. Frieze, On the connectivity of random m-orientable graphs and digraphs, Combinatorica 2 (1982), 347-359.
9. T. I. Fenner and A. M. Frieze, On the existence of hamiltonian cycles in a class of random graphs, Discrete Math 45 (1983), 301-305.
10. A. M. Frieze, Finding Hamilton cycles in sparse random graphs, J Combinatorial Theory B 44 (1988),230-250.
11. A. Frieze and T. Łuczak, Hamiltonian cycles in a class of random graphs: One step further, M. Karonski, J. Jaworski, and A. Rucinski, editors, John Wiley, New Jersey, 1990, pp. 53-59.
12. J. Komlós and E. Szemerédi, Limit distributions for the existence of Hamilton circuits in a random graph, Discrete Math 43 (1983), 55-63.
13. M. Krivelevich, B. Sudakov, V. Vu, and N. C. Wormald, Random regular graphs of high degree, Random Struct Algorithms 18 (2001), 346-363.
14. L. Pósa, Hamiltonian circuits in random graphs, Discrete Math 14 (1976), 359-364.
15. R. W. Robinson and N. C. Wormald, Almost all regular graphs are Hamiltonian, Random Struct Algorithms 5 (1994), 363-374.
16. A. Schrijver, Combinatorial optimization: Polyhedra and efficiency, Springer, Berlin, 2003.