A sharp threshold for random graphs with a monochromatic triangle in every edge coloring

Memoirs of the American Mathematical Society

Volumn 179, Issue 845, 2006, Pages 1-71

  Friedgut, Ehud ^a   Rödl, Vojtech ^a   Ruciński, Andrzej ^a   Tetali, Prasad ^a  

^a NONE

Author keywords

Ramsey Theory; Random Graphs; Szem redi's Regularity Lemma; Threshold Phenomena

Indexed keywords

EID: 30344486649     PISSN: 00659266     EISSN: None     Source Type: Journal    
DOI: 10.1090/memo/0845     Document Type: Review

References (35)

1. D. Achlioptas, E. Friedgut, A sharp threshold for k-colorability. Random Structures and Algorithms, 14 (1999), 63-70.
2. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the regularity lemma, J. Algorithms 16(1) (1994), 80-109.
3. B. Bollobás, Random Graphs, Academic Press, London, 1985.
4. B. Bollobás and A. Thomason, Threshold functions, Combinatorica 7 (1987), 35-38.
5. R. Duke, H. Lefmann and V. Rödl, A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. Computing, 24 (1995), 598-620.
6. P. Erdös and A. Rényi, On random graphs I, Publ. Math. Debrecen 6 (1959), 290-297.
7. P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960), 17-61.
8. E. Friedgut, Sharp thresholds of graph properties, and the k-sat problem. Journal of the American Math. Soc., 12 (1999), no. 4, 1017-1054.
9. E. Friedgut, Y. Kohayakawa, V. Rödl, A. Ruciński and P. Tetali, Ramsey games against one-armed bandit, Combinatorics, Probability and Computing (2003)
10. E. Friedgut and M. Krivelevich, Sharp Thresholds for Ramsey Properties of Random Graphs, Random Structure and Algorithms 17(1) (2000), 1-19.
11. 4, Graphs and Combinatorics 2 (1986), 135-144.
12. P. Frankl and V. Rödl, Extremal problems on set systems, Random Structure and Algorithms 20(2) (2002), 131-164.
13. R. Graham , V. Rödl and A. Ruciński, On Schur properties of random subsets of integers Journal of Number Theory 61(2) (1996), 388-408.
14. E. Gyori, B. Rothschild and A. Ruciński, Every graph is contained in a sparsest possible balanced graph, Math. Proc. Cambr. Phil. Soc. 98 (1985), 397-401.
15. S. Janson, T. Łuczak and A.Ruciński, An exponential bound for the probability of nonexistence of a specified subgraph of a random graph, in: Proceedings of Random Graphs '87, Wiley, Chichester (1990), 73-87.
16. S. Janson, T. Luczak and A. Ruciński, Random Graphs, Wiley 2000, 333+xi pages.
17. S. Janson, K. Oleszkiewicz and A. Ruciński, Upper tails for subgraphs counts in random graphs, Israel J. Math, to appear.
18. S. Janson and A. Ruciński, The infamous upper bound, Random Structures Algorithms, 20(3), (2002) 317-342.
19. S. Janson and A. Ruciński, The deletion method for upper tails, Combinatorica, to appear.
20. Y. Kohayakawa, Szemerédi's regularity lemma for sparse graphs, Foundations of computational mathematics (Rio de Janeiro, 1997), Springer, Berlin, 1997, pp. 216-230.
21. Y. Kohayakawa, T. Luczak and V. Rödl Arithmetic progressions of length three in subsets of a random set, Acta Arithmetica LXXV (1996), 133-163
22. Y. Kohayakawa and V. Rödl, Regular Pairs in Sparse Random Graphs, Random Structure and Algorithms, (2003), 22(4) 359-434.
23. Y. Kohayakawa and V. Rödl, Szemerédi's regularity lemma and quasi-randomness, Recent Advances in Algorithmic Combinatorics (B. Reed and C. Linhares-Sales, eds.), CMS Books Math./Ouvrages Math. SMC, vol. 11, Springer, New York, 2003, pp. 289-351
24. J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, Paul Erdos is eighty, Vol. 2 (Keszthely, 1993), János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
25. A. Kurek and A. Ruciński, Two variants of the size Ramsey number, submitted
26. T. Łuczak, On triangle-free random graphs, Random Structures & Algorithms (2000), 16(3), 260-276.
27. T. Luczak, A. Ruciński and B. Voigt, Ramsey properties of random graphs, J. Comb. Th. Ser. B 56 (1992), 55-68.
28. B. Nagle and V. Rödl, Regularity properties for triple systems, Random Structures & Algorithms (2003), 23(3) 264-332.
29. V. Rödl and A. Ruciński, Lower bounds on probability thresholds for Ramsey properties, Combinatorics, Paul Erdos is Eighty (Vol.1), Keszthely(Hungary), Bolyai Soc. Math. Studies, 1993, pp.317-346.
30. V. Rödl and A. Ruciński, Random graphs with monochromatic triangles in every edge coloring, Random Structures and Algorithms 5 (1994), 253-270.
31. V. Rödl and A. Ruciński, Threshold functions for Ramsey properties, Journal of Amer. Math. Soc. Vol 8 (1995), 917-942.
32. V. Ródl and A. Ruciński, Rado partition theorem for random subsets of integers Proceedings of the London Mathematical Society 74(3) (1997) 481-502.
33. V. Rödl and A. Ruciński, Ramsey properties of random hypergraphs, J. Comb. Th. Ser. A 81 (1998), 1-33.
34. I. Z. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, North-Holland, Amsterdam, 1978, pp. 939-945.
35. E. Szemerédi, Regular partitions of graphs in Problèmes combinatoires et théorie des graphes, Orsay 1976, J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau, eds., Colloq. Internat. CNRS 260, Paris, 1978, 399-401.