Making $K_{r+1}$-Free Graphs $r$-partite

The Erdős-Simonovits stability theorem states that for all ε>0 there exists α>0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - αn^2, then one can remove εn^2 edges from G to obtain an r-partite graph. Füredi gave a short proof that one can choose α=ε. We give a bound for the relationship of αand \varepsilon which is asymptotically sharp as ε\to 0.

No reviews yet.

No comments yet.