Question 87
A group consists of $n$ tourists. However we choose 3 tourists, there are 2 of them who do not know each other. For any partition of tourists on two buses we can find two tourists who know each other and are on the same bus. Prove that in the tourist group there is a tourist who has at most $\frac{2}{5} n$ acquaintances.