The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645)
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: The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree |
scientific article; zbMATH DE number 6128662
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree |
scientific article; zbMATH DE number 6128662 |
Statements
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (English)
0 references
24 January 2013
0 references
