Paths of given length in tournaments

Abstract

We prove that every $n$-vertex tournament has at most $n{\left(\frac{n-1}{2}\right)}^k$ walks of length $k$.

Appendix with alternative entropy proof by Dingding Dong and Tomasz Ślusarczyk