partition coloring, prove inequality
Source: VJIMC 2009 2.4
June 12, 2021
combinatoricsinequalities
Problem Statement
Let be positive integers such that and denote . Suppose that are -element subsets of with the following property: for every there exists a partition (into pairwise disjoint subsets) such that(i) has precisely one element in common with each member of the above partition.
(ii) Every is disjoint from at least one member of the above partition.Show that .