Difference between revisions of "2006 Canadian MO Problems/Problem 4"
m (→Solution: +) |
|||
(5 intermediate revisions by 3 users not shown) | |||
Line 6: | Line 6: | ||
(b) Find the maximum number of cycle triplets possible. | (b) Find the maximum number of cycle triplets possible. | ||
==Solution== | ==Solution== | ||
− | + | ||
+ | |||
+ | [[Image:CMO2006Question4.jpg |700px]] | ||
+ | |||
==See also== | ==See also== |
Latest revision as of 18:20, 28 November 2023
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
See also
2006 Canadian MO (Problems) | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 | Followed by Problem 5 |