A note on stability for maximal $F$-free graphs
Combinatorics
2021-01-12 v1
Abstract
Popielarz, Sahasrabudhe and Snyder in 2018 proved that maximal -free graphs with edges contain a complete -partite subgraph on vertices. This was very recently extended to odd cycles in place of 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.
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