Minimum codegree condition for perfect matchings in k‐partite k‐graphs (Q5207463)
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: Minimum codegree condition for perfect matchings in k‐partite k‐graphs |
scientific article; zbMATH DE number 7146795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum codegree condition for perfect matchings in k‐partite k‐graphs |
scientific article; zbMATH DE number 7146795 |
Statements
Minimum codegree condition for perfect matchings in k‐partite k‐graphs (English)
0 references
30 December 2019
0 references
\(k\)-graph
0 references
\(k\)-partite \(k\)-graph
0 references
matching
0 references
perfect matching
0 references
0.91274214
0 references
0.9003945
0 references
0.8908029
0 references
0.8875363
0 references
0.88585246
0 references
0.8855189
0 references
0.8795297
0 references
