Powers of Hamilton cycles in tournaments
Our main aim is to show that for every ε > 0 and k ∈ N there is an n(ε, k) such that if T is a tournament of order n ≥n(ε, k) and in T every vertex has indegree at least ( 1 4+ε)n and at most ( 3 4-ε)n then T contains the kth power of a Hamilton cycle. © 1990.
Journal of Combinatorial Theory, Series B
Bollobás, B., & Häggkvist, R. (1990). Powers of Hamilton cycles in tournaments. Journal of Combinatorial Theory, Series B, 50 (2), 309-318. https://doi.org/10.1016/0095-8956(90)90085-E