MathDB
infinite family of sets, each of size r, no 2 of which share < s elements

Source: 2016 Saudi Arabia IMO TST , level 4+, II p3

July 29, 2020
combinatoricssetSubsets

Problem Statement

Given two 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.