Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs
Combinatorics
2020-12-18 v1
Abstract
We show that every 4-uniform hypergraph with vertices and minimum pair degree at least contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.
Keywords
Cite
@article{arxiv.2005.03391,
title = {Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs},
author = {Joanna Polcyn and Christian Reiher and Vojtěch Rödl and Andrzej Ruciński and Mathias Schacht and Bjarne Schülke},
journal= {arXiv preprint arXiv:2005.03391},
year = {2020}
}
Comments
Dedicated to Endre Szemer\'edi on the occasion of his $80^{\text{th}}$ birthday