Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs (Q5963389)
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: Counting and packing Hamilton -cycles in dense hypergraphs |
scientific article; zbMATH DE number 6542956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs |
scientific article; zbMATH DE number 6542956 |
Statements
Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs (English)
0 references
19 February 2016
0 references
\(k\)-uniform hypergraph
0 references
0.887673556804657
0 references
0.8722065091133118
0 references
0.8628970384597778
0 references
0.8586034774780273
0 references
0.8576839566230774
0 references
