Key points are not available for this paper at this time.
We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any \ (›0\) and \ (k3\), we show that asymptotically almost surely, every subgraph of the binomial random \ (k\) -uniform hypergraph \ (G^ (k) (n, n^-1) \) in which all \ ( (k-1) \) -sets are contained in at least \ ( (12+2) pn\) edges has a tight Hamilton cycle. This is a cyclic ordering of the \ (n\) vertices such that each consecutive \ (k\) vertices forms an edge. Mathematics Subject Classifications: 05C80, 05C35Keywords: Random graphs, hypergraphs, tight Hamilton cycles, resilience
Allen et al. (Mon,) studied this question.