MathDB
Cardinality of union is bounded from below

Source: Czech and Slovak Olympiad 1990, National Round, Problem 6

October 12, 2024
combinatoricsSetsSubsets

Problem Statement

Let k1k\ge 1 be an integer and S\mathsf S be a family of 2-element subsets of the index set {1,,2k}\{1,\ldots,2k\} with the following property: if M1,,M2k\mathsf M_1,\ldots,\mathsf M_{2k} are arbitrary sets such that \mathsf M_i\cap\mathsf M_j\neq\emptyset \Leftrightarrow \{i,j\}\in\mathsf S, then the union M1M2k\mathsf M_1\cup\ldots\cup\mathsf M_{2k} contains at least k2k^2 elements. Show that there is a suitable family S\mathsf S for any integer k1.k\ge1.