Unified approach to the generalized Turán problem and supersaturation
From MaRDI portal
Publication:2065917
DOI10.1016/j.disc.2021.112743zbMath1480.05072arXiv2008.12093OpenAlexW4221020129MaRDI QIDQ2065917
Máté Vizer, Dániel Gerbner, Zoltán Lóránt Nagy
Publication date: 13 January 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.12093
Related Items
Subgraph densities in a surface ⋮ Generalized Turán problems for \(K_{2,t}\) ⋮ Generalized Turán problems for complete bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting trees in graphs
- The clique density theorem
- Tree-minimal graphs are almost regular
- Hypergraph containers
- A note on supersaturated set systems
- Supersaturation problem for color-critical graphs
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
- An approximate version of Sidorenko's conjecture
- On a theorem of Rademacher-Turán
- A reverse Sidorenko inequality
- Supersaturated graphs and hypergraphs
- Walks and the spectral radius of graphs
- A Kruskal-Katona type theorem for graphs
- On the number of certain subgraphs contained in graphs with a given number of edges
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Some extremal results on complete degenerate hypergraphs
- On the local approach to Sidorenko's conjecture
- Compactness results in extremal graph theory
- New asymptotics for bipartite Turán numbers
- General lemmas for Berge-Turán hypergraph problems
- Avoiding long Berge cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Turán problems for disjoint copies of graphs
- Degree Powers in Graphs: The Erdős–Stone Theorem
- Maximum star densities
- On the Minimal Density of Triangles in Graphs
- On complete subgraphs of different orders
- Graphs with maximal number of adjacent pairs of edges
- A Generalized Turán Problem and its Applications
- Many H-Copies in Graphs with a Forbidden Tree
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Independent sets in hypergraphs
- On the Number of 4-Edge Paths in Graphs With Given Edge Density
- Extremal Results for Berge Hypergraphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
- Many \(T\) copies in \(H\)-free graphs
- On supersaturation and stability for generalized Turán problems
