The number of antichains in ranked posets

DOI10.1515/DMA.1991.1.1.35MaRDI QIDQ3211368zbMATH OpenOpenAlexFDO

Authors Alexander Sapozhenko

Publication date 1991

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1991.1.1.35

zbMATH Keywords

bipartite graphranked partially ordered setsasymptotic behavior of the number of antichains

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Cited in

(9)

• The minimum of the antichains in the factor poset
• Size of the largest antichain in a partition poset
• Generalized rank functions and quilts of alternating sign matrices
• The ANTI-order for caccc posets. I
• The ANTI-order for caccc posets. II
• Expected rank in antimatroids
• Independent sets in discrete tori of odd sidelength
• Des chaînes et des antichaînes dans les ensembles ordonnés finis
• Relations between powers of Dedekind numbers and exponential sums related to them

This page was built for publication: The number of antichains in ranked posets

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