Random polynomial graphs for random Turán problems
From MaRDI portal
Publication:6143381
DOI10.1002/jgt.23015arXiv2212.08050OpenAlexW4385637346MaRDI QIDQ6143381
Publication date: 24 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.08050
Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)
Cites Work
- The number of \(C_{2\ell}\)-free graphs
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Bounding the size of square-free subgraphs of the hypercube
- On a class of degenerate extremal graph problems
- Random Ramsey graphs for the four-cycle
- Many cliques in \(H\)-free subgraphs of random graphs
- Rational exponents in extremal graph theory
- Some extremal results on complete degenerate hypergraphs
- Cycles of even length in graphs
- On the rational Turán exponents conjecture
- Relative Turán numbers for hypergraph cycles
- Triangle-free subgraphs of hypergraphs
- Inverse Turán numbers
- More on the extremal number of subdivisions
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Inverting the Turán problem
- Large Subgraphs without Short Cycles
- Random algebraic construction of extremal graphs
- Poisson approximation for large deviations
- Subgraphs of a hypercube containing no small even cycles
- A Generalized Turán Problem and its Applications
- Graphs with few paths of prescribed length between any two vertices
- A generalized Turán problem in random graphs
- Relative Turán Problems for Uniform Hypergraphs
- The Extremal Number of the Subdivisions of the Complete Bipartite Graph
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Many Turán exponents via subdivisions
- Many \(T\) copies in \(H\)-free graphs
- Counting hypergraphs with large girth
