Turán number of four vertex-disjoint cliques

Alexandr Kostochka, Dadong Peng, Liang Zhang

Given a graph $H$, the Turán number $\mathrm{ex}(n,H)$ of $H$ is the maximum number of edges of an $n$-vertex simple graph containing no $H$ as a subgraph. Let $k{K}_p$ denote the disj…