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

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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

Original languageEnglish
JournalProceedings of the London Mathematical Society
DOIs
Publication statusPublished - Jan 1 2019

Fingerprint

Degree Condition
Uniform Hypergraph
Vertex Degree
Hamiltonian circuit
Lower bound

Keywords

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

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs. / Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, E.

In: Proceedings of the London Mathematical Society, 01.01.2019.

Research output: Contribution to journalArticle

@article{d8b7fe084e004b6e9338f90ef246b2c8,
title = "Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs",
abstract = "We show that every 3-uniform hypergraph with n vertices and minimum vertex degree at least (5/9 + o(1)) (n 2) contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.",
keywords = "05C45, 05C65 (primary), 05D05 (secondary)",
author = "Christian Reiher and Vojtěch R{\"o}dl and Andrzej Ruciński and Mathias Schacht and E. Szemer{\'e}di",
year = "2019",
month = "1",
day = "1",
doi = "10.1112/plms.12235",
language = "English",
journal = "Proceedings of the London Mathematical Society",
issn = "0024-6115",
publisher = "Oxford University Press",

}

TY - JOUR

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

AU - Reiher, Christian

AU - Rödl, Vojtěch

AU - Ruciński, Andrzej

AU - Schacht, Mathias

AU - Szemerédi, E.

PY - 2019/1/1

Y1 - 2019/1/1

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

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

KW - 05C45

KW - 05C65 (primary)

KW - 05D05 (secondary)

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

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

U2 - 10.1112/plms.12235

DO - 10.1112/plms.12235

M3 - Article

AN - SCOPUS:85061437199

JO - Proceedings of the London Mathematical Society

JF - Proceedings of the London Mathematical Society

SN - 0024-6115

ER -