Question 157
Given two positive integers $r \gt s$, and let $\mathscr{F}$ be an infinite family of sets, each of size $r$, no two of which share fewer than $s$ elements. Prove that there exists a set of size $r-1$ that shares at least $s$ elements with each set in $\mathscr{F}$.