Sparse pseudo-random graphs are hamiltonian

Journal of Graph Theory

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

  Krivelevich, Michael ^a   Sudakov, Benny ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037220811     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10065     Document Type: Article

References (28)

1. 1 N. Alon, Tough Ramsey graphs without short cycles, J Algebraic Combinatorics 4 ( 1995), 189–195.
2. 2 N. Alon, M. Krivelevich, and B. Sudakov, List coloring of random and pseudo‐random graphs, Combinatorica 19 ( 1999), 453–472.
3. 3 N. Alon and Y. Roichman, Random Cayley graphs and expanders, Random Structures and Algorithms 5 ( 1994), 271–284.
4. 4 N. Alon and J. H. Spencer, The probabilistic method, 2nd Ed., Wiley, New York, 2000.
5. 5 D. Bauer, H. J. Broersma, and H. J. Veldman, Not every 2‐tough graph is Hamiltonian, Discrete Appl Math 99 ( 2000), 317–321.
6. 6 B. Bollobás, T. I. Fenner, and A. M. Frieze, An algorithm for finding Hamilton paths and cycles in random graphs, Combinatorica 7 ( 1987), 327–341.
7. 7 A. Broder and E. Shamir, On the second eigenvalue of random regular graphs, Proc 28th IEEE FOCS, IEEE ( 1987), 286–294.
8. 8 F. R. K. Chung, Spectral graph theory, Regional Conference Series in Mathematics 92, Amer Math Soc Providence, 1997.
9. 9 F. R. K. Chung, R. L. Graham, and R. M. Wilson, Quasi‐random graphs, Combinatorica 9 ( 1989), 345–362.
10. 10 V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math 5 ( 1973), 215–218.
11. 11 V. Chvátal and P. Erdős, A note on Hamiltonian circuits, Discrete Math 2 ( 1972), 111–113.
12. 12 S. J. Curran and J. A. Gallian, Hamiltonian cycles and paths in Cayley graphs and digraphs–‐a survey, Discrete Math 156 ( 1996), 1–18.
13. 13 G. Dirac, Some theorems on abstract graphs, Proc London Math Society 2 ( 1952), 69–81.
14. 14 J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue in random regular graphs, Proc of 21th ACM STOC ( 1989), 587–598.
15. 15 A. M. Frieze, On the number of perfect matchings and Hamilton cycles in ε ‐regular non‐bipartite graphs, Electronic J Combinatorics Vol. 7 ( 2000), publ. R57.
16. 16 A. M. Frieze and M. Krivelevich, Hamilton cycles in random subgraphs of pseudo‐random graphs, Discrete Mathematics, in press.
17. 17 A. Frieze and C. McDiarmid, Algorithmic theory of random graphs, Random Structures and Algorithms 10 ( 1997), 5–42.
18. 18 M. Garey and D. Johnson, Computers and intractability: A guide to the theory of NP‐completeness, W. H. Freeman and Co., San Francisco, 1979.
19. 19 B. Jackson, Hamiltonian cycles in regular 2‐connected graphs, J Combin Theory Ser B 29 ( 1980), 27–46.
20. 20 J. Meng and Q. Huang, Almost all Cayley graphs are Hamiltonian, Acta Math Sinica N. S. 12 ( 1996), 151–155.
21. 21 J. Komlós and E. Szemeródi, Limit distributions for the existence of Hamilton circuits in a random graph, Discrete Mathe 43 ( 1983), 55–63.
22. 22 M. Krivelevich, B. Sudakov, and T. Szabó, Triangle factors in pseudo‐random graphs, submitted.
23. 23 M. Krivelevich, B. Sudakov, V. Vu, and N. Wormald, Random regular graphs of high degree, Random Structures and Algorithms 18 ( 2001), 346–363.
24. 24 L. Lovász, Combinatorial problems and exercises, North Holland, Amsterdam, 1979.
25. 25 L. Posa, Hamiltonian circuits in random graphs, Discrete Math 14 ( 1976), 359–364.
26. 26 M. Simonovits and V. T. Sós, Hereditary extended properties, quasi‐random graphs and not necessarily induced subgraphs, Combinatorica 17 ( 1997), 577–596.
27. 27 A. Thomason, Pseudorandom graphs, In: Random graphs'85 (Poznań 85), North‐Holland Math Stud 144, North Holland, Amsterdam, 1987, pp. 307–331.
28. 28 A. Thomason, Random graphs, strongly regular graphs and pseudorandom graphs, In: Surveys in Combinatorics 1987, London Math Soc Lecture Note Ser 123, Cambridge Univ Press, Cambridge, 1987, pp. 173–195.