Every graph is eventually Turán-good
From MaRDI portal
Publication:6170799
DOI10.1016/j.jctb.2023.06.004zbMath1519.05134arXiv2208.08499MaRDI QIDQ6170799
Paweł Rzążewski, Serguei Norine, Alexandra Wesolek, Natasha Morrison, JD Nir
Publication date: 10 August 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.08499
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- Pentagons vs. triangles
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- On the number of pentagons in triangle-free graphs
- Some sharp results on the generalized Turán numbers
- Maximizing five-cycles in \(K_r\)-free graphs
- Supersaturation for subgraph counts
- Some exact results for generalized Turán problems
- Subgraph densities in \(K_r\)-free graphs
- On complete subgraphs of different orders
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
- Paths are Turán-good