Abstract:Let n > k > ℓ be positive integers. We say a k-uniform hypergraph H contains a Hamilton (ℓ, k − ℓ)-cycle if there is a partition (L0, R0, L1, R1, . . . , Lt−1, Rt−1) of V (H) with |Li| = ℓ, |Ri| = k − ℓ such that Li ∪ Ri and Ri ∪ Li+1 (subscripts module t) are all edges of H for i = 0, 1, . . . , t − 1. In the present paper, we determine the tight minimum ℓ-degree condition that guarantees the existence of a Hamilton (ℓ, k − ℓ)-cycle in every k-uniform n-vertex hypergraph for k ≥ 7, k/2 ≤ ℓ ≤ k − 1 and suffici… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.