Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980)
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: Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.90511292219162
0 references
0.8894908428192139
0 references
0.8705090284347534
0 references
0.8642736673355103
0 references
0.863303005695343
0 references
