On Erdősʹ extremal problem on matchings in hypergraphs

In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative for k = 3 and n large enough.