olymmath

ISL 2015 C7

In a company of people some pairs are enemies. A group of people is called unsociable if the number of members in the group is odd and at least 3 , and it is possible to arrange all its members around a round table so that every two neighbors are enemies. Given that there are at most 2015 unsociable groups, prove that it is possible to partition the company into 11 parts so that no two enemies are in the same part.

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2015 Shortlist booklet, page 6.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2015/c7 · Tag 7ZC2DRHVWG · Edit this page on GitHub · Keys: j next, k previous