Tight Co-Degree Condition for Perfect Matchings in 4-Graphs Andrzej Czygrinow Vikram Kamat DOI: https://doi.org/10.37236/2338 Keywords: hypergraphs, matchings Abstract We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching. PDF Published 2012-05-21 Issue Volume 19, Issue 2 (2012) Article Number P20