Difference between revisions of "2006 Canadian MO Problems/Problem 4"
(No difference)
|
Revision as of 13:15, 6 February 2007
Problem
Consider a round robin tournament with teams, where two teams play exactly one match and there are no ties. We say that the teams , , and form a cycle triplet if beats , beats , and beats .
(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.