Back to Search
Start Over
Paths of given length in tournaments
- Publication Year :
- 2020
-
Abstract
- We prove that every $n$-vertex tournament has at most $n\left(\frac{n-1}{2}\right)^k$ walks of length $k$.<br />Comment: Appendix with alternative entropy proof by Dingding Dong and Tomasz \'Slusarczyk
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2012.00262
- Document Type :
- Working Paper