On hypergraph Turán problems with bounded matching number

Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results.