Problem

Source:

Tags: combinatorics, maximum and minimum



There are three colleges in a town. Each college has $n$ students. Any student of any college knows $n+1$ students of the other two colleges. Prove that it is possible to choose a student from each of the three colleges so that all three students would know each other.