MathDB
2016 Team #9

Source:

December 30, 2016

Problem Statement

Fix positive integers r>sr>s, and let FF be an infinite family of sets, each of size rr, no two of which share fewer than ss elements. Prove that there exists a set of size rāˆ’1r-1 that shares at least ss elements with each set in FF.