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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
