Tight co-degree condition for perfect matchings in 4-graphs

Andrzej Czygrinow, Vikram Kamat

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


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

Original languageEnglish (US)
Pages (from-to)1-16
Number of pages16
JournalElectronic Journal of Combinatorics
Issue number2
StatePublished - May 21 2012

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Tight co-degree condition for perfect matchings in 4-graphs'. Together they form a unique fingerprint.

Cite this