Finding tight Hamilton cycles in random hypergraphs faster (Q4993260)
From MaRDI portal
scientific article; zbMATH DE number 7359334
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding tight Hamilton cycles in random hypergraphs faster |
scientific article; zbMATH DE number 7359334 |
Statements
Finding tight Hamilton cycles in random hypergraphs faster (English)
0 references
15 June 2021
0 references
\(r\)-uniform hypergraph
0 references
absorbing method
0 references
Hamilton cycles
0 references
random graphs
0 references
0 references
