Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

By Christian Reiher, Vojtech Rödl, A. Ruci'nski, Mathias Schacht, Endre Szemer'edi. Proceedings of the London Mathematical Society, 2016

57 citations recorded by the source corpus.

We show that every 3‐uniform hypergraph with n vertices and minimum vertex degree at least (5/9+o(1))n2 contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/506ccdca93da628f23d71fd6d2577027f1117a56