Tight Co-Degree Condition for Perfect Matchings in 4-Graphs

Andrzej Czygrinow, Vikram Kamat

Abstract


We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

Keywords


hypergraphs, matchings

Full Text: PDF