Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs |
scientific article |
Statements
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (English)
0 references
25 January 2021
0 references
It is shown that every \(4\)-uniform hypergraph with \(n\) vertices and minimum pair degree at least \((5/9 + o(1))n^2/2\) contains a tight Hamiltonian cycle. The degree condition is asymptotically optimal.
0 references
Hamiltonian cycle
0 references
Dirac's theorem
0 references
hypergraph
0 references
