Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939)
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 6302961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs |
scientific article; zbMATH DE number 6302961 |
Statements
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (English)
0 references
11 June 2014
0 references
decision problem
0 references
0.9497644
0 references
0.94766545
0 references
0.94649285
0 references
0.9339738
0 references
0.9269389
0 references
0.9242896
0 references
0.9178875
0 references
0.9123517
0 references
0.90346277
0 references
