Back to Search Start Over

Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs.

Authors :
Polcyn, J.
Reiher, Chr.
Rödl, V.
Ruciński, A.
Schacht, M.
Schülke, B.
Source :
Acta Mathematica Hungarica; Aug2020, Vol. 161 Issue 2, p647-699, 53p, 6 Diagrams
Publication Year :
2020

Abstract

We show that every 4-uniform hypergraph with n vertices and minimum pair degree at least (5 / 9 + o (1)) n 2 / 2 contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
HYPERGRAPHS

Details

Language :
English
ISSN :
02365294
Volume :
161
Issue :
2
Database :
Complementary Index
Journal :
Acta Mathematica Hungarica
Publication Type :
Academic Journal
Accession number :
145030037
Full Text :
https://doi.org/10.1007/s10474-020-01078-7
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details