an international meeting - classic-
Source: bmo 1985
April 23, 2007
combinatorics proposedcombinatorics
Problem Statement
There are participants to an international meeting. In any group of three participants there are at least two who speak the same language. It is known that each participant speaks at most five languages. Prove that there exist at least participans who speak the same language.