Problem

Source: Bulgaria 1978 P3

Tags: combinatorics



On the name day of a man there are $5$ people. The men observed that of any $3$ people there are $2$ that knows each other. Prove that the man may order his guests around circular table in such way that every man have on its both side people that he knows. N. Nenov, N. Hazhiivanov