On offset Hamilton cycles in random hypergraphs

Publication date 22 February 2018

Abstract: An {em

e l l

-offset Hamilton cycle}

C

in a

k

-uniform hypergraph

H

on~

n

vertices is a collection of edges of

H

such that for some cyclic order of

[n]

every pair of consecutive edges

E_{i - 1}, E_{i}

in

C

(in the natural ordering of the edges) satisfies

| E_{i - 1} c a p E_{i} | = e l l

and every pair of consecutive edges

E_{i}, E_{i + 1}

in

C

satisfies

| E_{i} c a p E_{i + 1} | = k - e l l

. We show that in general

s q r t e^{k} e l l! (k - e l l)! / n^{k}

is the sharp threshold for the existence of the

e l l

-offset Hamilton cycle in the random

k

-uniform hypergraph

H_{n, p}^{(k)}

. We also examine this structure's natural connection to the 1-2-3 Conjecture.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: On offset Hamilton cycles in random hypergraphs