Hunting for sharp thresholds

Random Structures and Algorithms

Volumn 26, Issue 1-2, 2005, Pages 37-51

  Friedgut, Ehud ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Phase transition; Random graphs; Threshold phenomenon

Indexed keywords

EID: 22144460479     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20042     Document Type: Conference Paper

References (20)

1. D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Structures Algorithms, 14 (1999), 63-70.
2. D. Achlioptas and C. Moore, The asymptotic order of the random &-SAT threshold, Proc FOCS, 2002, pp. 779-788.
3. D. Achlioptas and C. Moore, On the 2-colorability of random hypergraphs, Proc RANDOM 02, 2002, pp. 78-90.
4. k(In 2 + ο(1)), submitted. Extended Abstract in STOC'03, 2003, pp. 223-231.
5. D. Achlioptas and A. Naor, The two possible values of the chromatic number of a random graph, submitted. Extended Abstract in STOC'04.
6. N. Alon, private communication, 1998.
7. B. Bollobás, Random graphs, Academic Press, London, 1985.
8. J. Bourgain, Appendix to [14] below.
9. J. Bourgain and G. Kalai, Influences of variables and threshold intervals under group symmetries, Geometric and Functional Analysis 7 (1997), 438-461.
10. B. Bollobás and A. Thomason, Threshold functions, Combinatorica 7 (1987), 35-38.
11. P. Erdos and A. Rényi, On random graphs I, Publ Math Debrecen 6 (1959), 290-297.
12. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
13. P. Erdos and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 7 (1987), 35-38.
14. E. Friedgut, Sharp thresholds of graph properties, and the &-SAT problem, J Amer Math Soc 12(4) (1999), 1017-1054.
15. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold, Proc Amer Math Soc 124 (1996), 2993-3002.
16. E. Friedgut and M. Krivelevich, Sharp thresholds for Ramsey properties of random graphs, Random Structure Algorithms 17(1) (2000), 1-19.
17. E. Friedgut, V. Rödl, A. Ruciński, and P. Tetali, Random graphs with a monochromatic triangle in every edge coloring; a sharp threshold, submitted.
18. M. Krivelevich, B. Sudakov, and V. Vu, Sharp threshold for network reliability, Combin Probab Comput 11 (2002), 465-474.
19. N. Linial and R. Meshulam, Homological connectivity of random 2-complexes, submitted.
20. M. Molloy, Models for random constraint satisfaction problems, Proc STOC 2002, pp. 209-217.