For tournaments on n vertices, the maximum number of directed 4k-cycles is asymptotic to (1 + 2 times the sum from i=1 to infinity of (2/((2i-1)pi))^(4k)) times the random tournament's count, attained by the carousel tournament.
Colombo, Sui circuiti nei grafi completi,Boll
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Maximizing directed cycles in tournaments
For tournaments on n vertices, the maximum number of directed 4k-cycles is asymptotic to (1 + 2 times the sum from i=1 to infinity of (2/((2i-1)pi))^(4k)) times the random tournament's count, attained by the carousel tournament.