Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs (Q1627213)

Summary: We prove that for integers \(2 \leq \ell < k\) and a small constant \(c\), if a \(k\)-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability \(p \geq O(n^{-(k-\ell)-c})\), then with high probability the resulting \(k\)-uniform hypergraph contains a Hamilton \(\ell\)-cycle. This complements a recent analogous result for Hamilton \(1\)-cycles due to \textit{M. Krivelevich} et al. [Comb. Probab. Comput. 25, No. 6, 909--927 (2016; Zbl 1372.05202)], and a comparable theorem in the graph case due to \textit{T. Bohman} et al. [Random Struct. Algorithms 22, No. 1, 33--42 (2003; Zbl 1013.05044)].