Turán number of complete bipartite graphs with bounded matching number

Huan Luo, Xiamiao Zhao, Mei Lu

Let $\mathcal{F}$ be a family of graphs. A graph $G$ is $\mathcal{F}$-free if $G$ does not contain any $F\in \mathcal{F}$ as a subgraph. The Turán number $ex(n,\mathcal{F})$ is t…