Sharp thresholds for certain Ramsey properties of random graphs

Random Structures and Algorithms

Volumn 17, Issue 1, 2000, Pages 1-19

  Friedgut, Ehud ^a,c   Krivelevich, Michael ^b,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034345376     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200008)17:1<1::AID-RSA1>3.0.CO;2-4     Document Type: Article

References (11)

1. D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Structures Algorithms 14 (1999), 63-70.
2. B. Bollobás, Random graphs, Academic Press, London, 1985.
3. B. Bollobás and A. Thomason, Threshold functions, Combinatorica 7 (1987), 35-38.
4. P. Erdos and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3 (1983), 181-192.
5. E. Friedgut, Sharp thresholds of graph properties, and the k-sat problem, J Amer Math Soc 12 (1999), 1017-1054.
6. 4, Graphs Combinatorics 2 (1986), 135-144.
7. T. Łuczak, A. Ruciński, and B. Voigt, Ramsey properties of random graphs, J Combin Theory Ser B 56 (1992), 55-68.
8. V. Rödl and A. Ruciński, Lower bounds on probability thresholds for Ramsey properties, Combinatorics, Paul Erdos is Eighty (Vol. 1), Bolyai Soc. Math. Studies, Keszthely, Hungary, 1993, pp.317-346.
9. V. Rödl and A. Ruciński, Random graphs with monochromatic triangles in every edge coloring, Random Structures Algorithms 5 (1994), 253-270.
10. V. Rödl and A. Ruciński, Threshold functions for Ramsey properties, J Amer Math Soc 8 (1995), 917-942.
11. V. Rödl and A. Ruciński, Ramsey properties of random hypergraphs, J Combin Theory Ser A 81 (1998), 1-33.