On powers of tight Hamilton cycles in randomly perturbed hypergraphs

Yulin Chang, Jie Han, Lubos Thoma

For integers $k\ge 3$ and $r\ge 2$, we show that for every $\alpha >0$, there exists $\epsilon >0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum code…