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

DOI10.1016/S0166-218X(99)00073-6MaRDI QIDQ1302155zbMATHOpenAlexFDO

Authors E. Rodney Canfield, Konrad Engel

Publication date 12 December 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00073-6

zbMATH Keywords

upper boundSperner theorempartition latticepartitions of an integersize of the largest antichainsize of the largest level in graded posets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)

Recommendations

• The size of the largest antichain in the partition lattice
• Size of the largest antichain in a partition poset
• Large antichains in the partition lattice
• About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets

Cited in

(8)

• 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
• 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
• Superantichains in the Lattice of Partitions of a Set
• Size of the largest antichain in a partition poset
• Integer partitions and the Sperner property
• The size of the largest antichain in the partition lattice

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)