MathDB
Miklos Schweitzer 1971_7

Source:

October 29, 2008
combinatorics proposedcombinatorics

Problem Statement

Let n2 n \geq 2 be an integer, let S S be a set of n n elements, and let Ai,  1im A_i , \; 1\leq i \leq m, be distinct subsets of S S of size at least 2 2 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