Generalized Turán problems for complete bipartite graphs

Dániel Gerbner, Balázs Patkós

Published 2021-01-20Version 1

For graph $G$, $F$ and integer $n$, the generalized Tu\'an number $ex(n,G,F)$ denotes the maximum number of copies of $G$ that an $F$-free $n$-vertex graph can have. We study this parameter when both $G$ and $F$ are complete bipartite graphs.