arXiv Analytics

Sign in

arXiv:2011.11427 [math.CO]AbstractReferencesReviewsResources

A Stability Theorem for Maximal $C_{2k+1}$-free Graphs

Jian Wang, Shipeng Wang, Weihua Yang, Xiaoli Yuan

Published 2020-11-23Version 1

For any positive integer $k$, we show that every maximal $C_{2k+1}$-free graph with at least $n^2/4-o(n^{3/2})$ edges contains an induced complete bipartite subgraph on $(1-o(1))n$ vertices. We also show that this is best possible.

Related articles: Most relevant | Search more
arXiv:1608.04675 [math.CO] (Published 2016-08-16)
A Stability Theorem for Maximal $K_{r+1}$-free Graphs
arXiv:1304.1680 [math.CO] (Published 2013-04-05, updated 2013-05-14)
Degree powers in $C_5$-free graphs
arXiv:2211.02838 [math.CO] (Published 2022-11-05)
Two stability theorems for $\mathcal{K}_{\ell + 1}^{r}$-saturated hypergraphs