We show that for k≥3, r≥2 and α>0, there exists
ε>0 such that if p=p(n)≥n−(k−1k+r−2​)−1−ε and H is a k-uniform hypergraph
on n vertices with minimum codegree at least αn, then asymptotically
almost surely the union H∪G(k)(n,p) contains the rth power of a
tight Hamilton cycle. The bound on p is optimal up to the value of
ε and this answers a question of Bedenknecht, Han, Kohayakawa and
Mota