Threshold functions for ramsey properties

Journal of the American Mathematical Society

Volumn 8, Issue 4, 1995, Pages 917-942

  Rödl, Vojtech ^a   Ruciński, Andrzej ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968476631     PISSN: 08940347     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0894-0347-1995-1276825-6     Document Type: Article

References (26)

1. B. Bollobás, Threshold functions for small subgraphs, Math. Proc. Cambridge Philos. Soc. 90 (1981), 197–206.
2. ——, Random graphs, Academic Press, London, 1985.
3. B. Bollobás and A. Thomason, Threshold functions, Combinatorica 7 (1987), 35–38.
4. P. Erdős and A. Hajnal, Research problem 2–5, J. Combin. Theory 2 (1967), 104.
5. P. Erdős and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960), 17–61.
6. J. Folkman, Graphs with monochromatic complete subgraphs in every edge coloring, SIAM J. Appl. Math. 18 (1970), 19–29.
7. 4, Graphs Combin. 2 (1986), 135–144.
8. R. Graham, On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon, J. Combin. Theory 4 (1968), 300.
9. ——, Recent developments in Ramsey theory, Proc. Internat. Congr. Math., PWN, Warszawa, 1983, pp. 1555–1567.
10. R. Graham and J. Nešetřil, Large minimal sets which force long arithmetic progressions, J. Combin. Theory Ser. A 42 (1986), 270–276.
11. R. Graham, B. Rothschild, and J. Spencer, Ramsey theory (second edition), Wiley, New York, 1990.
12. R. Irving, On a bound of Graham and Spencer for a graph coloring constant, J. Combin. Theory Ser. B 15 (1973), 200–203.
13. S. Janson, Poisson approximation for large deviations, Random Structures Algorithms 1 (1990), 221–230.
14. T. Luczak, A. Ruciński, and B. Voigt, Ramsey properties of random graphs, J. Combin. Theory Ser. B 56 (1992), 55–68.
15. J. Nešetřil and V. Rödl, The Ramsey property for graphs with forbidden complete subgraphs, J. Combin. Theory Ser. B 20 (1976), 243–249.
16. ——, Van der Waerden theorem for sequences of integers not containing an arithmetic progression of k terms, Comment. Math. Univ. Carolin. 17 (1976), 675–681.
17. ——, Partite constructions and Ramsey set systems, Discrete Math. 75 (1989), 149–160.
18. ——, Partite constructions and Ramsey space systems, Mathematics of Ramsey Theory, Springer, Berlin and New York, 1990, pp. 98–108.
19. V. Rödl, On Ramsey families of sets, Graphs Combin. 6 (1990), 187–195.
20. V. Rödl and A. Ruciňski, Random graphs with monochromatic triangles in every edge coloring, Random Struct. Algorithms 5 (1994), 253–270.
21. ——, Lower bounds on probability thresholds for Ramsey properties, Combinatorics, Paul Erdős is Eighty (Volume 1) Keszthely (Hungary), Bolyai Soc. Math. Studies, 1993, pp. 317–346.
22. A. Ruciński, Small subgraphs of random graphs:a survey, Proceedings of Random Graphs’87, Wiley, Chichester, 1990, pp. 283–303.
23. J. Spencer, Restricted Ramsey configurations, J. Combin. Theory 19 (1975), 278–286.
24. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199–245.
25. ——, Partitions of graphs, Problems Combin. et Theorie des Graphes, Edition du C.N.R.S. 260 (1978), 399–402, Paris.
26. P. Varnavides, On certain sets of positive density, J. London Math. Soc. 34 (1959), 358–360.