Turán problems with bounded matching number in $k$-uniform hypergraphs

Jialin Liu, Mingyang Guo, Xiumei Wang

For a family $\mathcal{F}$ of $k$-graphs, $e{x}_k(n,\mathcal{F})$ denotes the maximum number of edges in an $n$-vertex $\mathcal{F}$-free $k$-graph. Let $M_{s+1}^k$ denote a matching…