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

DOI10.1016/S0166-218X(99)00073-6zbMath0935.06004OpenAlexW1973777419MaRDI QIDQ1302155

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)

Related Items (1)

Integer partitions and the Sperner property

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