Disjoint or entirely contained subsets
Source: CWMO 2012 Q3
October 1, 2012
combinatorics proposedcombinatorics
Problem Statement
Let be a set of elements and subsets of such that for any distinct subsets either they are disjoint or one contains the other. Find the maximum value of