Tight bound for powers of Hamilton cycles in tournaments

Nemanja Draganić, David Munhá Correia, Benny Sudakov

A basic result in graph theory says that any $n$-vertex tournament with in- and out-degrees larger than $\frac{n-2}{4}$ contains a Hamilton cycle, and this is tight. In 1990, Bollo…