English

A note on stability for maximal $F$-free graphs

Combinatorics 2021-01-12 v1

Abstract

Popielarz, Sahasrabudhe and Snyder in 2018 proved that maximal Kr+1K_{r+1}-free graphs with (11r)n22o(nr+1r)(1-\frac{1}{r})\frac{n^2}{2}-o(n^{\frac{r+1}{r}}) edges contain a complete rr-partite subgraph on no(n)n-o(n) vertices. This was very recently extended to odd cycles in place of K3K_3 by Wang, Wang, Yang and Yuan. We further extend it to some other 3-chromatic graphs, and obtain some other stability results along the way.

Keywords

Cite

@article{arxiv.2101.03223,
  title  = {A note on stability for maximal $F$-free graphs},
  author = {Dániel Gerbner},
  journal= {arXiv preprint arXiv:2101.03223},
  year   = {2021}
}

Comments

10 pages

R2 v1 2026-06-23T21:56:02.994Z