Turán Numbers of Vertex-disjoint Cliques in r-Partite Graphs

Abstract For two graphs G and H , the Turan number ex ( G , H ) is the maximum number of edges in a subgraph of G that contains no copy of H . Chen, Li, and Tu determined the Turan numbers ex ( K m , n , k K 2 ) for all k ≥ 1 Chen et al. (2009). In this paper we will determine the Turan numbers ex ( K a 1 , … , a r , k K r ) for all r ≥ 3 and k ≥ 1 .