MathDB
Extremal Set Theory

Source: Iranian National Olympiad (3rd Round) 2006

September 11, 2006
ceiling functioncombinatorics proposedcombinatorics

Problem Statement

Let EE be a family of subsets of {1,2,,n}\{1,2,\ldots,n\} with the property that for each A{1,2,,n}A\subset \{1,2,\ldots,n\} there exist BFB\in F such that nd2ABn+d2\frac{n-d}2\leq |A \bigtriangleup B| \leq \frac{n+d}2. (where AB=(AB)(BA)A \bigtriangleup B = (A\setminus B) \cup (B\setminus A) is the symmetric difference). Denote by f(n,d)f(n,d) the minimum cardinality of such a family. a) Prove that if nn is even then f(n,0)nf(n,0)\leq n. b) Prove that if ndn-d is even then f(n,d)nd+1f(n,d)\leq \lceil \frac n{d+1}\rceil. c) Prove that if nn is even then f(n,0)=nf(n,0) = n