Indexed metadata
Tight Co-Degree Condition for Perfect Matchings in 4-Graphs
Andrzej Czygrinow, Vikram Kamat
Source abstract
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.