Back to Search Start Over

Paths of given length in tournaments

Authors :
Sah, Ashwin
Sawhney, Mehtaab
Zhao, Yufei
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

Subjects :
Mathematics - Combinatorics

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.2012.00262
Document Type :
Working Paper

Tools

Authors Abstract Subjects Details