Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871414 | Discrete Applied Mathematics | 2018 | 9 Pages |
Abstract
Let k and â be integers satisfying 1â¤ââ¤kâ2. An â-offset Hamilton cycleC in a k-uniform hypergraph H on n vertices is a collection of edges of H such that for some cyclic order of [n] and every even i every pair of consecutive edges Eiâ1,Ei in C (in the natural ordering of the edges) satisfies |Eiâ1â©Ei|=â and every pair of consecutive edges Ei,Ei+1 in C satisfies |Eiâ©Ei+1|=kââ. We show that in general ekâ!(kââ)!ânk is the sharp threshold for the existence of the â-offset Hamilton cycle in the random k-uniform hypergraph Hn,p(k). We also examine this structure's natural connection to the 1-2-3 Conjecture.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andrzej Dudek, Laars Helenius,