Back to Search
Start Over
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
- Source :
- Proc. Lond. Math. Soc. (3) 119 (2019), no. 2, 409-439
- Publication Year :
- 2016
-
Abstract
- We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.<br />Comment: 38 pages, second version addresses changes arising from the referee reports
- Subjects :
- Mathematics - Combinatorics
05C65 (05C45)
Subjects
Details
- Database :
- arXiv
- Journal :
- Proc. Lond. Math. Soc. (3) 119 (2019), no. 2, 409-439
- Publication Type :
- Report
- Accession number :
- edsarx.1611.03118
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1112/plms.12235