MathDB
Sets and (maybe) graphs

Source: CIIM 2020 P3

October 26, 2020
combinatorics

Problem Statement

Let (m,r,s,t)(m,r,s,t) be positive integers such that ms+1m\geq s+1 and rtr\geq t. Consider mm sets A1,A2,,AmA_1, A_2, \dots, A_m with rr elements each one. Suppose that, for each 1im1\leq i\leq m, there exist at least tt elements of AiA_i, such that each one(element) belongs to (at least) ss sets AjA_j where jij\neq i. Determine the greatest quantity of elements in the following set A1A2A3AmA_1 \cup A_2 \cup A_3 \dots \cup A_m.