An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
- 101 Downloads
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  and Haxell, Kohayakawa, and Łuczak . 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  on uncrowded hypergraphs as given by Duke, Lefmann, and Rödl .
Unable to display preview. Download preview PDF.