Abstract
The following sharpening of Turán's theorem is proved. Let denote the complete --partite graph of order having the maximum number of edges. If is an -vertex -free graph with edges then there exists an (at most) -chromatic subgraph such that . Using this result we present a concise, contemporary proof (i.e., one applying Szemerédi's regularity lemma) for the classical stability result of Simonovits.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.