= Bipartite stability from few odd cycles
{title2=$|E(G)\triangle E(H)|\le11\epsilon\binom n2$}
Fix an odd cycle length. If the <graph> has <edge> density at least $1/2-\epsilon$ and sufficiently few copies of that cycle, <odd-cycle copies from positive triangle density> forces few <triangles in a graph>. The <triangle removal lemma> deletes at most $\epsilon\binom n2$ <edges>, after which the clique-free edit bound applies with two parts. Absorbing its linear rounding error into the density margin gives the displayed bound for large order.
Back to article page
