Difference between revisions of "2006 Canadian MO Problems/Problem 4"

 
m (Solution: +)
Line 6: Line 6:
 
(b) Find the maximum number of cycle triplets possible.
 
(b) Find the maximum number of cycle triplets possible.
 
==Solution==
 
==Solution==
 
 
{{solution}}
 
{{solution}}
  
 +
==See also==
 
*[[2006 Canadian MO]]
 
*[[2006 Canadian MO]]
 +
 +
{{CanadaMO box|year=2006|num-b=3|num-a=5}}

Revision as of 18:58, 7 February 2007

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

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

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