Extremal graphs for two vertex-disjoint copies of a clique
Published in Graphs and Combinatorics, 2022
This paper determines the Turán number for two vertex-disjoint cliques, using the classical Hajnal–Szemerédi theorem as a key tool.
Recommended citation: Chen, Wanfang, Lu, Changhong, and Yuan, Long-Tu. (2022). "Extremal graphs for two vertex-disjoint copies of a clique." Graphs and Combinatorics. 38(3), Paper No. 67.
Download Paper