学术文献库

论文标题

比赛中给定长度的路径

Paths of given length in tournaments

论文作者

Sah, Ashwin, Sawhney, Mehtaab, Zhao, Yufei

论文摘要

我们证明，每个$ n $ vertex锦标赛最多都有$ n \ left（\ frac {n-1} {2} {2} \ right）^k $步行$ k $。

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