Turán numbers of vertex-disjoint cliques in $r$-partite graphs

Jessica De Silva, Kristin Heysse, Adam Kapilow +2

For two graphs $G$ and $H$, the Turán 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 Turán numbe…