Turán's extremal problem in random graphs: Forbidding odd cycles

Combinatorica

Volumn 16, Issue 1, 1996, Pages 107-122

  Haxell, P E ^a   Kohayakawa, Y ^b   Luczak T ^c,d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c INSTITUTE OF MATHEMATICS   (Poland)

^d ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039334130     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01300129     Document Type: Article

References (17)

1. L. BABAI, M. SIMONOVITS, and J. H. SPENCER: Extremal subgraphs of random graphs, J. Graph Theory, 14 (1990), 599-622.
2. B. BOLLOBÁS: Extremal Graph Theory, Academic Press, London, 1978.
3. B. BOLLOBÁS: Random Graphs, Academic Press, London, 1985.
4. P. ERDOS, and A. H. STONE: On the structure of linear graphs, Bull. Amer. Math. Soc., 52 (1946), 1089-1091.
5. 4, Graphs and Combinatorics, 2 (1986), 135-144.
6. Z. FÜREDI: Random Ramsey graphs for the four-cycle, Discrete Mathematics, 126 (1994), 407-410.
7. P. E. HAXELL, Y. KOHAYAKAWA, and T. ŁUCZAK: The induced size-Ramsey number of cycles, Combinatorics, Probability and Computing (to appear).
8. P. E. MAXELL, Y. KOHAYAKAWA, and T. ŁUCZAK: Turán's extremal problem in random graphs: forbidding even cycles, J. Combin. Theory (Series B), 64 (1995), 273-287.
9. W. HOEFFDING: Probability inequalities for sums of bounded random variables, Jour. Amer. Statistical Assoc., 58 (1963), 13-30.
10. Y. KOHAYAKAWA: The regularity lemma of Szemerédi for sparse graphs, manuscript, 1993.
11. T. ŁUCZAK, A. RUCIŃSKI, and B. VOIGT: Ramsey properties of random graphs, J. Combin. Theory (Series B), 56 (1992), 55-68.
12. C. J. H. MCDIARMID: On the method of bounded differences, Surveys in Combinatorics, 1989, London Mathematical Society Lecture Notes Series 141 (Siemons, J., ed.), Cambridge University Press, Cambridge, 1989, 148-188.
13. V. RÖDL: Personal communication, July 1993.
14. V. RÖDL, and A. RUCIŃSKI: Lower bounds on probability thresholds for Ramsey properties, Combinatorics - Paul Erdos is Eighty (Volume 1) (D. Miklós, V. T. Sós, T. Szonyi, eds.), Bolyai Soc. Math. Studies, Budapest, 1993, 317-346.
15. V. RÖDL, and A. RUCIŃSKI: Random graphs with monochromatic triangles in every edge colouring, Random Structures and Algorithms, 5 (1994), 253-270.
16. V. RÖDL, and A. RUCIŃSKI: Threshold functions for Ramsey properties, J. Amer. Math. Soc. (to appear).
17. E. SZEMERÉDI: Regular partitions of graphs, Problèmes Combinatoires et Théorie des Graphes, Proc. Colloque Inter. CNRS (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau, eds), CNRS, Paris, 1978, 399-401.