Supersaturation for subgraph counts
From MaRDI portal
Publication:2117531
DOI10.1007/s00373-021-02454-yzbMath1485.05083arXiv1903.08059OpenAlexW2921339014MaRDI QIDQ2117531
JD Nir, Andrew John Radcliffe, Jonathan Cutler
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.08059
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (5)
Paths of length three are \(K_{r+1}\)-Turán-good ⋮ Some exact results for generalized Turán problems ⋮ On supersaturation and stability for generalized Turán problems ⋮ Every graph is eventually Turán-good ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs
Cites Work
- The clique density theorem
- Supersaturation problem for color-critical graphs
- On a theorem of Rademacher-Turán
- On the maximum number of cliques in a graph
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- A Turán type problem concerning the powers of the degrees of a graph
- The maximum number of cliques in graphs without long cycles
- Degree powers in graphs with forbidden subgraphs
- New asymptotics for bipartite Turán numbers
- Maximizing five-cycles in \(K_r\)-free graphs
- The number of cliques in graphs of given order and size
- On the Minimal Density of Triangles in Graphs
- On complete subgraphs of different orders
- The maximum number of triangles in a graph of given maximum degree
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Maximizing the Number of Independent Sets of a Fixed Size
- Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
- Graphs with many r -cliques have large complete r -partite subgraphs
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
- On supersaturation and stability for generalized Turán problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Supersaturation for subgraph counts
