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

Andrzej Czygrinow, Theodore Molla

Research output: Contribution to journalArticle

11 Citations (Scopus)

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

Fingerprint

Hamilton Cycle
Graph in graph theory

Keywords

  • Absorbing lemma
  • Hamilton cycle
  • Hypergraphs

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Tight codegree condition for the existence of loose hamilton cycles in 3-graphs. / Czygrinow, Andrzej; Molla, Theodore.

In: SIAM Journal on Discrete Mathematics, Vol. 28, No. 1, 2014, p. 67-76.

Research output: Contribution to journalArticle

@article{41a4a17a343149d8bb31fbef27928851,
title = "Tight codegree condition for the existence of loose hamilton cycles in 3-graphs",
abstract = "In 2006, K{\"u}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.",
keywords = "Absorbing lemma, Hamilton cycle, Hypergraphs",
author = "Andrzej Czygrinow and Theodore Molla",
year = "2014",
doi = "10.1137/120890417",
language = "English (US)",
volume = "28",
pages = "67--76",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

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

AU - Czygrinow, Andrzej

AU - Molla, Theodore

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Absorbing lemma

KW - Hamilton cycle

KW - Hypergraphs

UR - http://www.scopus.com/inward/record.url?scp=84898900628&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84898900628&partnerID=8YFLogxK

U2 - 10.1137/120890417

DO - 10.1137/120890417

M3 - Article

AN - SCOPUS:84898900628

VL - 28

SP - 67

EP - 76

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 1

ER -