论文标题
最大$ C_ {2K+1} $的稳定定理 - 免费图
A Stability Theorem for Maximal $C_{2k+1}$-free Graphs
论文作者
论文摘要
对于任何正整数$ k $，我们表明每个最大$ c_ {2k+1} $ - 至少$ n^2/4-o（n^{3/2}）$ edges包含一个诱导的完整的二颗粒子图$（1-o（1-o（1-o（1-o（1-o（1）））N $ Vertices。我们还表明这是最好的。
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.
