Question 47
In a group of $m$ girls and $n$ boys, any two of them either know each other, or do not know each other. For any two boys and two girls, at least one boy and one girl do not know each other. Prove that the number of boy-girl pairs that know each other is at most $m + \frac{n(n-1)}{2}$.