Miklos Schweitzer 1971_7
Source:
October 29, 2008
combinatorics proposedcombinatorics
Problem Statement
Let be an integer, let be a set of elements, and let , be distinct subsets of of size at least such that A_i \cap A_j \not\equal{} \emptyset, A_i \cap A_k \not\equal{} \emptyset, A_j \cap A_k \not\equal{} \emptyset, \;\textrm{imply}\ \;A_i \cap A_j \cap A_k \not\equal{} \emptyset \ . Show that m \leq 2^{n\minus{}1}\minus{}1.
P. Erdos