Science
On the generalized Tur\'an number of complete bipartite graphs
Key Points
Announce Type: cross Abstract: For graphs $F$ and $H$, the generalized Tur\'an number $\mathrm{ex}(n,F,H)$ denotes the maximum number of copies of $F$ in an $H$-free graph on $n$ vertices. We prove that if $s\in \{2,3\}$, $s< a\leq b$ and $t$ is sufficiently large, then $\mathrm{ex}(n,K_{a,b},K_{s,t})=\Theta(n^s)$. The $s=2$, $a=b=3$ case of this result answers a question of Spiro. Proving another conjecture of Spiro, we show that for every graph $F$ with at least one edge, there exist...
arXiv:2606.09801v1 Announce Type: cross
Abstract: For graphs $F$ and $H$, the generalized Tur\'an number $\mathrm{ex}(n,F,H)$ denotes the maximum number of copies of $F$ in an $H$-free graph on $n$ vertices. We prove that if $s\in \{2,3\}$, $s< a\leq b$ and $t$ is sufficiently large, then $\mathrm{ex}(n,K_{a,b},K_{s,t})=\Theta(n^s)$. The $s=2$, $a=b=3$ case of this result answers a question of Spiro.
Proving another conjecture of Spiro, we show that for every graph $F$ with at least one edge, there exist infinitely many real numbers $r$ such that $\mathrm{ex}(n,F,H)=\Theta(n^r)$ holds for some graph $H$.