The Size of the Largest Antichain in the
โ
E.Rodney Canfield
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 268 KB
Consider the poset 6 n of partitions of an n-element set, ordered by refinement. The sizes of the various ranks within this poset are the Stirling numbers of the second kind. Let a= 1 2 &e log(2)ร4. We prove the following upper bound for the ratio of the size of the largest antichain to the size of