MathNet 2001 — Part 01 Question 65

Let $X$ be a set with $n$ elements. Given $k \gt 2$ subsets of $X$, each with at least $r$ elements, show that we can always find two of them whose intersection has at least $r - \dfrac{n k}{4k - 4}$ elements.