Turán number of complete bipartite graphs with bounded matching number (2408.13994v1)

Abstract: Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathcal{F}$ as a subgraph. The Tur\'an number $ex(n, \mathscr{F})$ is the maximum number of edges in an $n$-vertex $\mathscr{F}$-free graph. Let $M_{s}$ be the matching consisting of $ s $ independent edges. Recently, Alon and Frank determined the exact value of $ex(n,{K_{m},M_{s+1}})$. Gerbner obtained several results about $ex(n,{F,M_{s+1}})$ when $F$ satisfies certain proportions. In this paper, we determine the exact value of $ex(n,{K_{l,t},M_{s+1}})$ when $s, n$ are large enough for every $3\leq l\leq t$. When $n$ is large enough, we also show that $ex(n,{K_{2,2}, M_{s+1}})=n+{s\choose 2}-\left\lceil\frac{s}{2}\right\rceil$ for $s\ge 12$ and $ex(n,{K_{2,t},M_{s+1}})=n+(t-1){s\choose 2}-\left\lceil\frac{s}{2}\right\rceil$ when $t\ge 3$ and $s$ is large enough.