arXiv Analytics

Sign in

arXiv:2101.03223 [math.CO]AbstractReferencesReviewsResources

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

Dániel Gerbner

Published 2021-01-08Version 1

Popielarz, Sahasrabudhe and Snyder in 2018 proved that maximal $K_{r+1}$-free graphs with $(1-\frac{1}{r})\frac{n^2}{2}-o(n^{\frac{r+1}{r}})$ edges contain a complete $r$-partite subgraph on $n-o(n)$ vertices. This was very recently extended to odd cycles in place of $K_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.

Comments: 10 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2206.07525 [math.CO] (Published 2022-06-15)
Homotopy and the Homomorphism Threshold of Odd Cycles
arXiv:1907.05018 [math.CO] (Published 2019-07-11)
Structural domination and coloring of some ($P_7, C_7$)-free graphs
arXiv:1108.5254 [math.CO] (Published 2011-08-26, updated 2012-06-03)
Turán numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions