2007 IMO Problems/Problem 3

Revision as of 15:43, 10 June 2010 by Yashbudde (talk | contribs) (Solution)


In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a clique if each two of them are friends. (In particular, any group of fewer than two competitors is a clique.) The number of members of a clique is called its size. Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged in two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room.


Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

2007 IMO (Problems) • Resources
Preceded by
Problem 2
1 2 3 4 5 6 Followed by
Problem 4
All IMO Problems and Solutions