Counting and packing Hamilton \(\ell\)-cycles in dense hypergraphs (Q5963389): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.4310/JOC.2016.v7.n1.a6 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962739781 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4310/JOC.2016.V7.N1.A6 / rank | |||
Normal rank | |||
Latest revision as of 13:32, 9 December 2024
scientific article; zbMATH DE number 6542956
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
