An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth

C

2 k -free subgraph of a random graph may have, obtaining best possible results for a range of p=p(n). Our estimates strengthen previous bounds of Füredi [12] and Haxell, Kohayakawa, and Łuczak [13]. Two main tools are used here: the first one is an upper bound for the number of graphs with large even-girth, i.e., graphs without short even cycles, with a given number of vertices and edges, and satisfying a certain additional pseudorandom condition; the second tool is the powerful result of Ajtai, Komlós, Pintz, Spencer, and Szemerédi [1] on uncrowded hypergraphs as given by Duke, Lefmann, and Rödl [7].

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: February 17, 1995

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kohayakawa, Y., Kreuter, B. & Steger, A. An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. Combinatorica 18, 101–120 (1998). https://doi.org/10.1007/PL00009804

Download citation

  • AMS Subject Classification (1991) Classes:  05A16, 05C35, 05C38, 05C80