Tight codegree condition for the existence of loose hamilton cycles in 3-graphs

Andrzej Czygrinow, Theodore Molla

Research output: Contribution to journalArticle

12 Scopus citations

Abstract

In 2006, Kühn and Osthus [J. Combin. Theory Ser. B, 96 (2006), pp. 767 821] showed that if a 3-graph H on n vertices has minimum codegree at least (1/4 + o(1))n and n is even, then H has a loose Hamilton cycle. In this paper, we prove that the minimum codegree of n/4 suffices. The result is tight.

Original languageEnglish (US)
Pages (from-to)67-76
Number of pages10
JournalSIAM Journal on Discrete Mathematics
Volume28
Issue number1
DOIs
StatePublished - 2014

Keywords

  • Absorbing lemma
  • Hamilton cycle
  • Hypergraphs

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Tight codegree condition for the existence of loose hamilton cycles in 3-graphs'. Together they form a unique fingerprint.

  • Cite this