Generalized Turan number with given size

Abstract

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 $r\ge 3$ and $α\in(\frac 2 r,1]$, any graph $G$ with $m$ edges and $Ω(m^{\frac{αr}{2}})$ $K_r$-copies has a subgraph of order $n_0=Ω(m^\fracα{2})$, which contains $Ω(n_0^{\frac{i(r-2)α}{(2-α)r-2}})$ $K_i$-copies for each $i = 2, \ldots, r$. This implies an upper bound of $\mathrm{mex}(m, K_r, F)$ when an upper bound of $\mathrm{ex}(n,K_r,F)$ is known. Furthermore, we establish an improved upper bound of $\mathrm{mex}(m, K_r, F)$ by $\mathrm{ex}(n, F)$ and $\min_{v_0 \in V(F)} \mathrm{ex}(n, K_r, F - v_0)$. As a corollary, we show $\mathrm{mex}(m, K_r, K_{s,t}) = Θ( m^{\frac{rs - \binom{r}{2}}{2s-1}} )$ for $r \geq 3$, $s \geq 2r-2$ and $t \geq (s-1)! + 1$, and obtain non-trivial bounds for other graph classes such as complete $r$-partite graphs and $K_s \vee C_\ell$, etc.