Strong Turán stability
From MaRDI portal
Publication:5920701
zbMath1327.05168arXiv1409.8665MaRDI QIDQ5920701
Andrew J. Uzzell, Mykhaylo Tyomkyn
Publication date: 27 August 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8665
05C35: Extremal problems in graph theory
Related Items
Exact stability for Turán’s Theorem, A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs, Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs, A note on stability for maximal \(F\)-free graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a theorem of Rademacher-Turán
- Density conditions for triangles in multipartite graphs
- A note on Ramsey numbers
- A dense infinite Sidon sequence
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
- On the non-(p-1)-partite K_{p}-free graphs
- Some new results in extremal graph theory
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Turan's Graph Theorem
- Maxima for Graphs and a New Proof of a Theorem of Turán
