2006 Canadian MO Problems/Problem 4

Revision as of 17:20, 28 November 2023 by Tomasdiaz (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Consider a round robin tournament with $2n+1$ teams, where two teams play exactly one match and there are no ties. We say that the teams $X$, $Y$, and $Z$ form a cycle triplet if $X$ beats $Y$, $Y$ beats $Z$, and $Z$ beats $X$.

(a) Find the minimum number of cycle triplets possible.

(b) Find the maximum number of cycle triplets possible.

Solution

CMO2006Question4.jpg


See also

2006 Canadian MO (Problems)
Preceded by
Problem 3
1 2 3 4 5 Followed by
Problem 5