On the Hamiltonicity of triple systems with high minimum degree

Vojtěch Rödl; Andrzej Ruciński; Mathias Schacht; Endre Szemerédi

doi:10.1007/s00026-017-0345-1

On the Hamiltonicity of triple systems with high minimum degree

Combinatorics 2017-07-26 v2

Authors: Vojtěch Rödl , Andrzej Ruciński , Mathias Schacht , Endre Szemerédi

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

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

Keywords

3-uniform hypergraphs minimum vertex degree tight Hamiltonian cycle triple systems Hamiltonicity

Cite

@article{arxiv.1605.00773,
  title  = {On the Hamiltonicity of triple systems with high minimum degree},
  author = {Vojtěch Rödl and Andrzej Ruciński and Mathias Schacht and Endre Szemerédi},
  journal= {arXiv preprint arXiv:1605.00773},
  year   = {2017}
}