arXiv:1605.00773 Abstract | arXiv Analytics

Published 2016-05-03Version 1

We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\binom{n-1}{2}$ contains a tight Hamiltonian cycle.

Categories: math.CO

Subjects: 05C65, 05C45

Keywords: high minimum degree, triple systems, hamiltonicity, minimum vertex degree, tight hamiltonian cycle

Related articles: Most relevant | Search more

arXiv:1407.4845 [math.CO] (Published 2014-07-17)

Hamiltonicity and $σ$-hypergraphs

Christina Zarb

arXiv:1802.04586 [math.CO] (Published 2018-02-13)

Hamiltonicity in randomly perturbed hypergraphs

Jie Han, Yi Zhao

arXiv:1009.1298 [math.CO] (Published 2010-09-07, updated 2012-11-13)

Matchings in 3-uniform hypergraphs