MathDB
Student from one school knows all students from next school

Source: Baltic Way 2011

November 6, 2011
inductioncombinatorics proposedcombinatorics

Problem Statement

In Greifswald there are three schools called A,BA,B and CC, each of which is attended by at least one student. Among any three students, one from AA, one from BB and one from CC, there are two knowing each other and two not knowing each other. Prove that at least one of the following holds:
[*]Some student from AA knows all students from BB. [*]Some student from BB knows all students from CC. [*] Some student from CC knows all students from AA.