An extremal problem for antichains of subsets of a multiset

DOI10.1016/0012-365X(87)90146-4zbMath0607.05009OpenAlexW2038621400MaRDI QIDQ1085160

G. F. Clements

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90146-4

zbMATH Keywords

antichainsmultiset

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Enumerative combinatorics (05A99)

Related Items (1)

The cubical poset is additive

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On uniqueness of maximal antichains of subsets of a multiset
• Antichains in the set of subsets of a multiset
• A generalization of the Kruskal-Katona theorem
• On maximal antichains containing no set and its complement
• More on the generalized Macaulay theorem. II
• A generalization of a combinatorial theorem of macaulay
• On Existence of Distinct Representative Sets for Subsets of a Finite Set

This page was built for publication: An extremal problem for antichains of subsets of a multiset