MathDB
Find large subset of A not containing entirely any A_i

Source: Bulgarian Spring Tournament 2023 12.4

March 25, 2023
combinatorics

Problem Statement

Given is a set AA of nn elements and positive integers k,mk, m such that 4k<n4 \leq k <n and mmin{k3,n2}m \leq \min \{k-3, \frac {n} {2}\}. Let A1,A2,,AlA_1, A_2, \ldots, A_l be subsets of AA, all with size kk, such that AiAjm|A_i \cap A_j| \leq m for all iji \neq j. Prove that there exists a subset BB of AA with at least nm+1+m\sqrt[m+1]{n}+m elements which doesn't contain entirely any of the subsets A1,A2,,AlA_1, A_2, \ldots, A_l.