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

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)409-439
Number of pages31
JournalProceedings of the London Mathematical Society
Volume119
Issue number5
DOIs
Publication statusPublished - Jan 1 2019

    Fingerprint

Keywords

  • 05C45
  • 05C65 (primary)
  • 05D05 (secondary)

ASJC Scopus subject areas

  • Mathematics(all)

Cite this