MathDB
partition coloring, prove inequality

Source: VJIMC 2009 2.4

June 12, 2021
combinatoricsinequalities

Problem Statement

Let k,m,nk,m,n be positive integers such that 1mn1\le m\le n and denote S={1,2,,n}S=\{1,2,\ldots,n\}. Suppose that A1,A2,,AkA_1,A_2,\ldots,A_k are mm-element subsets of SS with the following property: for every i=1,2,,ki=1,2,\ldots,k there exists a partition S=S1,iS2,iSm,iS=S_{1,i}\cup S_{2,i}\cup\ldots\cup S_{m,i} (into pairwise disjoint subsets) such that
(i) AiA_i has precisely one element in common with each member of the above partition. (ii) Every Aj,jiA_j,j\ne i is disjoint from at least one member of the above partition.
Show that k(n1m1)k\le\binom{n-1}{m-1}.