Two-country conference
Source: Kürschák 1996, problem 2
July 15, 2014
modular arithmeticcombinatorics unsolvedcombinatorics
Problem Statement
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 .