Paths of given length in tournaments
Ashwin Sah, Mehtaab S. Sawhney, Yufei Zhao · Combinatorial Theory · 2023
Author(s): Sah, Ashwin; Sawhney, Mehtaab; Zhao, Yufei | Abstract: We prove that every \(n\)-vertex tournament has at most \(n \left(\frac{n-1}{2} \right)^k\) walks of length \(k\).Mathematics Subject Classifications: 05C38, 05D99Keywords: Paths, tournaments