Hamiltonicity in randomly perturbed hypergraphs

Abstract: For integers

k g e 3

and

1 l e e l l l e k - 1

, we prove that for any

a l p h a > 0

, there exist

e p s i l o n > 0

and

C > 0

such that for sufficiently large

n i n (k - e l l) m a t h b b N

, the union of a

k

-uniform hypergraph with minimum vertex degree

a l p h a n^{k - 1}

and a binomial random

k

-uniform hypergraph

m a t h b b G^{(k)} (n, p)

with

p g e n^{- (k - e l l) - e p s i l o n}

for

e l l g e 2

and

p g e C n^{- (k - 1)}

for

e l l = 1

on the same vertex set contains a Hamiltonian

e l l

-cycle with high probability. Our result is best possible up to the values of

e p s i l o n

and

C

and answers a question of Krivelevich, Kwan and Sudakov.

Recommendations

Cites work

Cited in

(30)

This page was built for publication: Hamiltonicity in randomly perturbed hypergraphs