Polynomial-time perfect matchings in dense hypergraphs

Peter Keevash, Fiachra Knox, Richard Mycroft

Let $H$ be a $k$-graph on $n$ vertices, with minimum codegree at least $n/k+cn$ for some fixed $c>0$. In this paper we construct a polynomial-time algorithm which finds either…