Tuesday, 6 April 2010

co.combinatorics - Sperner's theorem and "pushing shadows around"

Let mathcalB be a collection of k-sets , subsets of an n-set S. For k<n define the shade of mathcalB to be nablamathcalB=DsubsetS:|D|=k+1,existsBinmathcalB,BsubsetD

and the shadow of mathcalB to be
DeltamathcalB=DsubsetS:|D|=k1,existsBinmathcalB,DsubsetB
Sperner proved the lemma: |DeltamathcalB|geqfracknk+1|mathcalB| for k>0, and |nablamathcalB|geqfracnkk+1|mathcalB| for k<n.



This implies that if klefrac12(n1), then |nablamathcalB|geq|mathcalB| and if kgeqfrac12(n+1) then |DeltamathcalB|geq|mathcalB|. Now the proof proceeds in the obvious steps: Suppose we have an antichain mathcalA, and it has pi elements of size i. If i<frac12(n1) then from the above we can substitute them with pi elements of size i+1. Similarly for the elements of size i>frac12(n+1). You end up with an antichain of elements of size lfloorfracn2rfloor giving you the proof of Sperner's theorem.



I really enjoyed Combinatorics of finite sets by I. Anderson which treats Sperner's theorem, LYM, Erdos-Ko-Rado, Kruskal-Katona etc. The above is just a sketch but there you can find all the details.

No comments:

Post a Comment