Maximum cliques in a graph without disjoint given subgraph

Fangfang Zhang, Yaojun Chen, Ervin Gyori +1

The generalized Turán number $\ex(n,K_s,F)$ denotes the maximum number of copies of $K_s$ in an $n$-vertex $F$-free graph. Let $kF$ denote $k$ disjoint copies of $F$. Gerbner, Meth…