Resilience for tight Hamiltonicity

Abstract: We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any

g a m m a > 0

and

k g e 3

, we show that asymptotically almost surely, every subgraph of the binomial random

k

-uniform hypergraph

in which all

(k - 1)

-sets are contained in at least

edges has a tight Hamilton cycle. This is a cyclic ordering of the

n

vertices such that each consecutive

k

vertices forms an edge.

This page was built for publication: Resilience for tight Hamiltonicity