Max edges in K_{r+1}-free graph on n vertices is T(n,r) = (1 − 1/r) n²/2, achieved by Turán graph. Extremal graph theory pillar.
Max edges in K_{r+1}-free graph on n vertices is T(n,r) = (1 − 1/r) n²/2, achieved by Turán graph. Extremal graph theory pillar.