Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa +1

For $k\ge 2$ and $r\ge 1$ such that $k+r\ge 4$, we prove that, for any $\alpha >0$, there exists $\epsilon >0$ such that the union of an $n$-vertex $k$-graph with minimum codegree $\left(1-\bino…