Antichains in the set of subsets of a multiset

DOI10.1016/0012-365X(84)90128-6zbMath0534.05006MaRDI QIDQ790113

G. F. Clements

Publication date: 1984

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

zbMATH Keywords

binomial coefficientKruskal-Katona theoremsubsetsmultisetsc-antichain

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (8)

An extremal problem for antichains of subsets of a multiset ⋮ Applications of the symmetric chain decomposition of the lattice of divisors ⋮ On multiset k-families ⋮ Characterizing profiles of \(k\)-families in additive Macaulay posets ⋮ Multiset antichains having minimal downsets ⋮ On existence of sets of distinct representatives for families of subsets of a multiset ⋮ Unnamed Item ⋮ A generalization of the Kruskal-Katona theorem

Cites Work

• A generalization of the Kruskal-Katona theorem
• On maximal antichains containing no set and its complement
• The minimal number of basic elements in a multiset antichain
• More on the generalized Macaulay theorem. II
• Existence theorems for Sperner families
• Inequalities concerning numbers of subsets of a finite set
• A minimization problem concerning subsets of a finite set
• A generalization of a combinatorial theorem of macaulay
• On Existence of Distinct Representative Sets for Subsets of a Finite Set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Antichains in the set of subsets of a multiset