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, 05D99
Keywords: Paths, tournaments
Main Content
Enter the password to open this PDF file:
Preparing document for printing…
