MathDB
A representation for two subsets of set

Source: Iranian National Olympiad (3rd Round) 2004

January 9, 2009
graph theorycombinatorics proposedcombinatorics

Problem Statement

Suppose that F \mathcal F is a family of subsets of X X. A,B A,B are two subsets of X X s.t. each element of F \mathcal{F} has non-empty intersection with A,B A, B. We know that no subset of X X with n \minus{} 1 elements has this property. Prove that there is a representation A,B A,B in the form A \equal{} \{a_1,\dots,a_n\} and B \equal{} \{b_1,\dots,b_n\}, such that for each 1in 1\leq i\leq n, there is an element of F \mathcal F containing both ai,bi a_i, b_i.