An upper bound for the size of the largest antichain in the poset of partitions of an integer

From MaRDI portal
(Redirected from Publication:1302155)





This nice and interesting paper proves a new and sharp upper bound for the ratio of the size of the largest antichain and the size of the largest level in graded posets with at least 12 elements. Furthermore it gives an (asymptotical) upper bound for the same ratio in the partition lattice of an integer.











This page was built for publication: An upper bound for the size of the largest antichain in the poset of partitions of an integer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302155)