New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484)
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: New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help |
scientific article; zbMATH DE number 1495915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help |
scientific article; zbMATH DE number 1495915 |
Statements
23 January 2001
0 references
matchings in hypergraphs
0 references
codegree sequence
0 references
Rödl nibble
0 references
polynomial method
0 references
strong concentration
0 references
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (English)
0 references
0.8030157089233398
0 references
0.8017717003822327
0 references
0.7995714545249939
0 references
0.7953595519065857
0 references
0.7939640283584595
0 references
