Turán number of two vertex-disjoint copies of cliques
摘要
The Turán number of a given graph H, denoted by ex(n, H), is the maximum number of edges in an H-free graph on n vertices. Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number ex(n, Kp ∪ Kq) of a vertex-disjoint union of cliques Kp and Kq for all values of n.