On Matchings in Hypergraphs

We show that if the largest matching in a k-uniform hypergraph G on n vertices has precisely s edges, and n>2k²s/log k, then H has at most n k - n-s k edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all k-subsets which intersect a given set of s vertices.