\(d\)-matching in \(k\)-uniform hypergraphs (Q4597954)
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: d-matching in k-uniform hypergraphs |
scientific article; zbMATH DE number 6818814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(d\)-matching in \(k\)-uniform hypergraphs |
scientific article; zbMATH DE number 6818814 |
Statements
d-matching in k-uniform hypergraphs (English)
0 references
14 December 2017
0 references
matching
0 references
perfect matching
0 references
\(k\)-uniform hypergraph
0 references
ore-type
0 references
0.9332612752914428
0 references
0.9047786593437196
0 references
0.8921496272087097
0 references
0.8582425117492676
0 references
0.8571633696556091
0 references
