An organization has $n$ members, each two of which know exactly one of the others. Prove that there is a member that knows everyone.
Problem
Source: II International Festival of Young Mathematicians Sozopol 2011, Theme for 10-12 grade
Tags: combinatorics