Generalized Turan number with given size

Yan Wang, Yue Xu, Jiasheng Zeng +1

Generalized Turán problem with given size, denoted as $\mathrm{mex}(m,K_r,F)$, determines the maximum number of $K_r$-copies in an $F$-free graph with $m$ edges. We prove that for…