KURSCHAK 1996 Problem 2
Two countries ( and ) organize a conference, and they send an equal number of participants. Some of them have known each other from a previous conference. Prove that one can choose a nonempty subset of the participants from such that one of the following holds:
- the participants from each know an even number of people in ,
- the participants from each know an odd number of participants in .
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.