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.
Recommendations
Cited in
(8)- On a continuous analog of Sperner's problem
- About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets
- The size of the largest antichain in the partition lattice
- Size of the largest antichain in a partition poset
- Integer partitions and the Sperner property
- Superantichains in the Lattice of Partitions of a Set
- scientific article; zbMATH DE number 841566 (Why is no real title available?)
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
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)