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 the normal view instead:
scientific article; zbMATH DE number 6128662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9535874724388124
0 references
0.8999159932136536
0 references
0.8961250185966492
0 references
0.8879859447479248
0 references
0.8828038573265076
0 references
