Extremal graph for disjoint cliques
= Extremal graph for disjoint cliques
For fixed positive integers $r,s$ and sufficiently large $n$, the unique extremal <graph> forbidding $s$ vertex-disjoint copies of the <complete graph> $K_{r+1}$ is the <join of graphs> $K_{s-1}+T_r(n-s+1)$, up to <isomorphic graphs>. Each forbidden <clique> would require a distinct <vertex> of $K_{s-1}$.