Turan theorem

Among $n$-vertex graphs containing no $K_{r+1}$, the maximum number of edges is attained by the complete $r$-partite graph whose part sizes differ by at most one, denoted $T_r(n)$.