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$.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2020
- DOI:
- 10.48550/arXiv.2012.00262
- arXiv:
- arXiv:2012.00262
- Bibcode:
- 2020arXiv201200262S
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- Appendix with alternative entropy proof by Dingding Dong and Tomasz \'Slusarczyk