A Stability Theorem for Maximal -free Graphs
arXiv:1608.04675
Abstract
For , we show that every maximal -free graph on vertices with edges contains a complete -partite subgraph on vertices. We also show that this is best possible. This result answers a question of Tyomkyn and Uzzell.
21 pages