On the maximum number of edges in a hypergraph with given matching number

The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{(3s+23),(n3)−(n−s3)} for all n,s,n≥3s+2.