On uniqueness of maximal antichains of subsets of a multiset

DOI10.1007/BF02454163zbMATH Open0527.05001OpenAlexW2038858572MaRDI QIDQ595653FDOQ595653

G. F. Clements

Publication date: 1984

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02454163

zbMATH Keywords

antichainmultisetset of subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• A generalization of a combinatorial theorem of macaulay
• On Existence of Distinct Representative Sets for Subsets of a Finite Set
• Title not available (Why is that?)
• Strong properties in partially ordered sets. I
• Sets containing a maximal number of pairwise incomparable \(n\)-dimensional k-ary sets
• Maximum antichains in the product of chains
• On the Divisors of a Number
• Strong properties in partially ordered sets. II

Cited In (3)

• Multiset antichains having minimal downsets
• An extremal problem for antichains of subsets of a multiset
• Analogues of the Smale and Hirsch theorems for cooperative Boolean and other discrete systems

This page was built for publication: On uniqueness of maximal antichains of subsets of a multiset

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