An extremal problem for random graphs and the number of graphs with large even-girth
From MaRDI portal
(Redirected from Publication:1280282)
Recommendations
- Extremal results in random graphs
- On extremal subgraphs of random graphs
- Turán's extremal problem in random graphs: Forbidding even cycles
- Extremal problems for k-colour graphs and exact inequalities for pairs of random elements
- scientific article; zbMATH DE number 1225794
- On the size of a random maximal graph
- scientific article; zbMATH DE number 3333193
- Extremal subgraphs of random graphs
Cited in
(21)- Counting hypergraphs with large girth
- Counting Gallai 3-colorings of complete graphs
- Extremal results for random discrete structures
- The structure of almost all graphs in a hereditary property
- \(K_4\)-free subgraphs of random graphs revisited
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- An analogue of the Erdős-Gallai theorem for random graphs
- The number of \(C_{2\ell}\)-free graphs
- The number of \(K_{m,m}\)-free graphs
- Relative Turán problems for uniform hypergraphs
- Regular pairs in sparse random graphs I
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
- Turán's extremal problem in random graphs: Forbidding even cycles
- Triangle-free subgraphs of hypergraphs
- scientific article; zbMATH DE number 3307332 (Why is no real title available?)
- On \(K^ 4\)-free subgraphs of random graphs
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Large subgraphs without short cycles
- Turán's theorem for pseudo-random graphs
- scientific article; zbMATH DE number 4183438 (Why is no real title available?)
This page was built for publication: An extremal problem for random graphs and the number of graphs with large even-girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280282)
