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.
Published
2012-05-21
How to Cite
Czygrinow, A., & Kamat, V. (2012). Tight Co-Degree Condition for Perfect Matchings in 4-Graphs. The Electronic Journal of Combinatorics, 19(2), P20. https://doi.org/10.37236/2338
Issue
Volume 19, Issue 2 (2012)
Article Number
P20