@inproceedings{9bb8aed101414395b4d93c53d0609cfc,
title = "Finding perfect matchings in dense hypergraphs",
abstract = "We show that for any integers k ≥ 3 and c ≥ 0 there is a polynomial-time algorithm, that given any n-vertex k-uniform hypergraph H with minimum codegree at least n/k − c, finds either a perfect matching in H or a certificate that no perfect matching exists.",
author = "Jie Han and Peter Keevash",
note = "Publisher Copyright: Copyright {\textcopyright} 2020 by SIAM; 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 ; Conference date: 05-01-2020 Through 08-01-2020",
year = "2020",
language = "English",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "2366--2377",
editor = "Shuchi Chawla",
booktitle = "31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020",
}