On extremal hypergraphs for hamiltonian cycles
Combinatorics
2011-12-01 v1
Abstract
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur\'an- and Dirac-type results. While the Tur\'an-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on the minimum vertex degree.
Keywords
Cite
@article{arxiv.1111.7028,
title = {On extremal hypergraphs for hamiltonian cycles},
author = {Roman Glebov and Yury Person and Wilma Weps},
journal= {arXiv preprint arXiv:1111.7028},
year = {2011}
}
Comments
13 pages