Fractional and integer matchings in uniform hypergraphs

Our main result improves bounds of Markström and Ruciński on the minimum dd-degree which forces a perfect matching in a kk-uniform hypergraph on nn vertices. We also extend bounds of Bollobás, Daykin and Erdős by asymptotically determining the minimum vertex degree which forces a matching of size t