Polynomial Time Perfect Matchings in Dense Hypergraphs 2013 (stoc212fp keevash

Polynomial-Time Perfect Matchings in Dense HypergraphsPeter Keevash School of Mathematical Sciences, Queen Mary,University of London London E1 4NS United Kingdomp.keevash@qmul.ac.ukFiachra Knox School of Mathematical Sciences, Queen Mary,University of London London E1 4NS United KingdomF.Knox@qmul.ac.ukRichard Mycroft School of MathematicsUniversity of Birmingham Birmingham B31 4AFUnited Kingdom r.mycroft@bham.ac.ukABSTRACT Let H be a k-graph on n vertices, with minimum codegree at least n/k + c