An extremal problem for random graphs and the number of graphs with large even-girth

Combinatorica

Volumn 18, Issue 1, 1998, Pages 101-120

  Kohayakawa, Y ^a   Kreuter, B ^b   Steger, A ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b HUMBOLDT UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032410189     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009804     Document Type: Article

References (22)

1. M. AJTAI, J. KOMLÓS, J. PINTZ, J. SPENCER, and E. SZEMERÉDI: Extremal uncrowded hypergraphs. J. Combin. Theory Ser. A, 32 (1982), 321-335.
2. L. BABAI, M. SIMONOVITS, and J. SPENCER: Extremal subgraphs of random graphs. J. Graph Theory, 14 (1990), 599-622.
3. C. T. BENSON: Minimal regular graphs of girths eight and twelve. Canad. J. Math., 18 (1966), 1091-1094.
4. B. BOLLOBÁS: Extremal Graph Theory. Academic Press, London, 1978.
5. B. BOLLOBÁS: Random Graphs. Academic Press, London, 1985.
6. J. A. BONDY and M. SIMONOVITS: Cycles of even length in graphs. J. of Combin. Theory Ser. B, 16 (1974), 97-105.
7. R. A. DUKE, H. LEFMANN, and V. RÖDL: On uncrowded hypergraphs. Random Sctructures and Algorithms, 6 (2-3) (1995), 209-212.
8. P. ERDOS: Some of my old and new combinatorial problems. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows, and VLSI-Layout, pages 35-45, Springer-Verlag, Berlin, Heidelberg, 1990.
9. P. ERDOS and R. J. FAUDREE: Problem presented at Kolloquium über Kombinatorik. Bielefeld, Germany, November 1990.
10. P. ERDOS and M. SIMONOVITS: Compactness results in extremal graph theory. Combinatorica, 2 (3) (1982), 275-288.
11. P. FRANKL and Z. FÜREDI: Exact solution of some Turán-type problems. J. Combin. Theory Ser. A, 45 (1987), 226-262.
12. Z. FÜREDI: Random Ramsey graphs for the four-cycle. Discrete Mathematics, 126 (1994), 407-410.
13. P. E. HAXELL, Y. KOHAYAKAWA, and T. ŁUCZAK: Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B, 64 (1995), 273-287.
14. P. E. HAXELL, Y. KOHAYAKAWA, AND T. ŁUCZAK: Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, 16 (1) (1996), 107-122.
15. D. J. KLEITMAN and D. B. WILSON: On the number of graphs which lack small cycles Manuscript, 1994; accepted for publication in Discrete Mathematics.
16. D. J. KLEITMAN and K. J. WINSTON: On the number of graphs without 4-cycles. Discrete Mathematics, 41 (1982), 167-172.
17. 4-free subgraphs of random graphs. Combinatorica, 17 (2) (1997), 173-213.
18. B. KREUTER: Extremale und Asymptotische Graphentheorie für verbotene bipartite Untergraphen. Diplomarbeit, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, January 1994.
19. B. KREUTER: Threshold functions for asymmetric Ramsey properties with respect to vertex colorings. Random Structures and Algorithms, 9 (3) (1996), 335-348.
20. M. SIMONOVITS: Extremal graph theory. In L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory, volume 2, pages 161-200, Academic Press, London, 1983.
21. A. STEGER: Asymptotic Properties of H-free Graphs. Habilitationsschrift, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, November 1993.
22. 10,s. J. of Combin. Theory Ser. B, 52 (1991), 113-116.