Question 52
Consider $n \ge 4$ persons at a party. Suppose that whenever $4 \le r \le n$, it is not possible to arrange any $r$ of these persons in a circle such that each of them knows the two others he stands next to. Prove that on the whole there are at most $\frac{3}{2}(n-1)$ acquaintances among these persons.