KMO 2010 Problem 4
There are people and some people shaked hands each other. Two people can shake hands at most 1 time. For arbitrary four people such that shaked hands, then one of shaked hand each other. Prove the following statements. (a) Prove that people can be divided into two groups, , such that for all where and , and shaked hands or and didn't shake hands. (b) There exist two people such that the set of people who are not and that shaked hands with is same wiith the set of people who are not and that shaked hands with .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.