Hamiltonicity thresholds in Achlioptas processes

Random Structures and Algorithms

Volumn 37, Issue 1, 2010, Pages 1-24

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

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Hamilton cycles; Random graph processes

Indexed keywords

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

References (29)

1. M. Ajtai, J. Komlós, and E. Szemerédi, First occurrence of Hamilton cycles in random graphs,In Cycles in graphs (Burnaby, B.C., 1982), Vol. 115, North-Holland Mathematical Studies, North-Holland, Amsterdam, 1985, pp. 173-178.
2. N. Alon and J. H. Spencer, The probabilistic method, 2nd edition, Wiley-Interscience, New York, 2000.
3. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced allocations, SIAM J Comput 29 (1999),180-200.
4. I. Benjamini, S. Haber, M. Krivelevich, and E. Lubetzky, The isoperimetric constant of the random graph process, Random Struct Algorithms 32 (2008), 101-114.
5. T. Bohman and A. Frieze, Avoiding a giant component, Random Struct Algorithm 19 (2001), 75-85.
6. T. Bohman, A. Frieze, M. Krivelevich, P. Loh, and B. Sudakov, Ramsey games with giants, preprint.
7. T. Bohman and A. Frieze, Hamilton cycles in 3-out, Random Struct Algorithms 35 (2009), 393-417.
8. T. Bohman, A. Frieze, and N. C. Wormald, Avoidance of a giant component in half the edge set of a random graph, Random Struct Algorithms 25 (2004), 432-449.
9. T. Bohman and D. Kravitz, Creating a giant component, Comb Probab Comput 15 (2006), 489-511.
10. B. Bollobás, Random graphs, 2nd edition, Vol. 73, Cambridge University Press, Cambridge, 2001.
11. B. Bollobás, The evolution of sparse graphs, In Graph theory and combinatorics, Academic Press, London, 1984, pp. 35-57.
12. 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.
13. B. Bollobás and A. M. Frieze, On matchings and Hamiltonian cycles in random graphs, In Random graphs'83 (Poznan, 1983), Vol. 118, North-Holland Mathematics Studies, NorthHolland, Amsterdam, 1985, pp. 23-46.
14. B. Bollobás and A. Thomason, Random graphs of small order, In Random graphs'83 (Poznan, 1983), Vol. 118, North-Holland Mathematical Studies, North-Holland, Amsterdam, 1985, pp. 47-97.
15. P. Erdos and A. Rényi, On the existence of a factor of degree one of a connected random graph, Acta Math Acad Sci Hun 17 (1966), 359-368.
16. W. Feller, An introduction to probability theory and its applications, 3rd edition, Vol. I, John Wiley & Sons Inc., New York, 1968.
17. A. D. Flaxman, D. Gamarnik, and G. B. Sorkin, Embracing the giant component, Random Struct Algorithms 27 (2005), 277-289.
18. A. Frieze and M. Krivelevich, On two Hamilton cycle problems in random graphs, Israel J Math 166 (2008), 221-234.
19. S. Janson, T. Łuczak, and A. Rucinski, Random graphs, Wiley-Interscience, New York, 2000, xii+333 pp.
20. N. L. Johnson and S. Kotz, Urn models and their application. Wiley Series in Probability and Mathematical Statistics, John Wiley & Sons, New York-London-Sydney, 1977, xiii+402 pp.
21. J. Komlós and E. Szemerédi, Limit distribution for the existence of Hamiltonian cycles in a random graph, Discrete Math 43 (1983), 55-63.
22. M. Krivelevich, P.-S. Loh, and B. Sudakov, Avoiding small subgraphs in Achlioptas processes, Random Struct Algorithms 34 (2009), 165-195.
23. M. Marciniszyn, D. Mitsche, and M. Stojaković, Online graph balanced graph avoidance games, Eur J Comb 28 (2007), 2248-2263.
24. M. Marciniszyn, R. Spöhel, and A. Steger, Online Ramsey games in random graphs, Comb Probab Comput 18 (2009), 271-300.
25. A. Prakash, R. Spöhel, and H. Thomas, Balanced online Ramsey games in random graphs, Electron J Comb 16 (2009), Research Paper 11, 22 pp.
26. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J Comb Theory Ser B 67 (1996), 111-151.
27. L. Pósa, Hamiltonian circuits in random graphs, Discrete Math 14 (1976), 359-364.
28. B. Sudakov and V. Vu, Resilience of graphs, Random Struct Algorithms 33 (2008), 409-433.
29. J. Spencer and N. Wormald, Birth control for giants, Combinatorica 27 (2007), 587-628.