Tight co-degree condition for perfect matchings in 4-graphs (Q426891)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight co-degree condition for perfect matchings in 4-graphs |
scientific article; zbMATH DE number 6045713
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight co-degree condition for perfect matchings in 4-graphs |
scientific article; zbMATH DE number 6045713 |
Statements
Tight co-degree condition for perfect matchings in 4-graphs (English)
0 references
12 June 2012
0 references
Summary: We give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.
0 references
hypergraphs
0 references
matchings
0 references
