An extremal problem for random graphs and the number of graphs with large even-girth
From MaRDI portal
Publication:1280282
DOI10.1007/PL00009804zbMath0910.05059WikidataQ97694922 ScholiaQ97694922MaRDI QIDQ1280282
Publication date: 14 March 1999
Published in: Combinatorica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)
Related Items (17)
The number of \(C_{2\ell}\)-free graphs ⋮ Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ Extremal results for random discrete structures ⋮ Turán's theorem for pseudo-random graphs ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ Counting hypergraphs with large girth ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ The structure of almost all graphs in a hereditary property ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ The number of \(K_{m,m}\)-free graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers ⋮ Regular pairs in sparse random graphs I ⋮ Triangle-free subgraphs of hypergraphs ⋮ Counting Gallai 3-colorings of complete graphs
This page was built for publication: An extremal problem for random graphs and the number of graphs with large even-girth
