Paths of given length in tournaments
Combinatorics
2023-02-13 v2
Abstract
We prove that every -vertex tournament has at most walks of length .
Keywords
Cite
@article{arxiv.2012.00262,
title = {Paths of given length in tournaments},
author = {Ashwin Sah and Mehtaab Sawhney and Yufei Zhao},
journal= {arXiv preprint arXiv:2012.00262},
year = {2023}
}
Comments
Appendix with alternative entropy proof by Dingding Dong and Tomasz \'Slusarczyk