Powers of Hamilton cycles in tournaments (Q923097)

Let \(T_ n\) denote a tournament with n nodes in which every node has indegree and outdegree at least \((1/4+\epsilon)n\); the authors show that such a tournament must contain the k-th power of a Hamilton cycle provided that n is sufficiently large, depending on \(\epsilon\) and k.