 
Summary: Hfree graphs of large minimum degree
Noga Alon
Benny Sudakov
Abstract
We prove the following extension of an old result of AndrŽasfai, Erdos and SŽos. For every fixed
graph H with chromatic number r + 1 3, and for every fixed > 0, there are n0 = n0(H, ) and
= (H) > 0, such that the following holds. Let G be an Hfree graph on n > n0 vertices with
minimum degree at least 1  1
r1/3 + n. Then one can delete at most n2
edges to make G
rcolorable.
1 Introduction
TurŽan's classical Theorem [11] determines the maximum number of edges in a Kr+1free graph on n
vertices. It easily implies that for r 2, if a Kr+1free graph on n vertices has minimum degree at
least (1 1
r )n, then it is rcolorable (in fact, it is a complete rpartite graph with equal color classes).
The following stronger result has been proved by AndrŽasfai, Erdos and SŽos [2].
Theorem 1.1 ([2]) If G is a Kr+1free graph of order n with minimum degree (G) > 1  1
r1/3 n
then G is rcolorable.
