A stability theorem for maximal \(K_{r+1}\)-free graphs
From MaRDI portal
Publication:723887
DOI10.1016/j.jctb.2018.04.001zbMath1391.05141arXiv1608.04675OpenAlexW2963849949WikidataQ130009338 ScholiaQ130009338MaRDI QIDQ723887
Julian Sahasrabudhe, Richard Snyder, Kamil Popielarz
Publication date: 24 July 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04675
Related Items (3)
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
Cites Work
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Large generalized books are \(p\)-good
- 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
- Strong Turán stability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A stability theorem for maximal \(K_{r+1}\)-free graphs
