Adding random edges to dense graphs

Random Structures and Algorithms

Volumn 24, Issue 2, 2004, Pages 105-117

  Bohman, Tom ^a   Frieze, Alan ^a   Krivelevich, Michael ^b   Martin, Ryan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. T. Bohman, A. Frieze, and R. Martin, How many random edges make a dense graph Hamiltonian? Random Structures Algorithms 22 (2003), 33-42.
2. B. Bollobás, Random graphs, Academic Press, New York, 1985.
3. B. Bollobás, Random graphs, Combinatorics, Proc, Swansea, London Math Soc Lecture Note Ser 52, Cambridge University Press, Cambridge, 1981, pp. 80-102.
4. B. Bollobás and F. Chung, The diameter of a cycle plus a random matching, SIAM J Discrete Math 1 (1988), 328-333.
5. R. Diestel, Graph theory, Springer-Verlag, New York, 1997.
6. P. Erdos and A. Rényl, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
7. A. Frieze, On the independence number of random graphs, Discrete Math 81 (1990), 171-175.
8. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley-Interscience Series, New York, 2000.
9. J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory, Combinatorics (Paul Erdos Is Eighty) 2 (1993), 295-352.
10. T. Łuczak, The chromatic number of random graphs, Combinatorica 11 (1991), 45-54.
11. E. Szemerédi, Regular partitions of graphs, Coll Int CNRS No 260 Problèmes Combinatories et Théorie des Graphes, Orsay, 1976, pp. 399-401.