The minimal number of basic elements in a multiset antichain

DOI10.1016/0097-3165(78)90077-8zbMath0401.05003OpenAlexW2048364936MaRDI QIDQ1254998

G. F. Clements

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90077-8

zbMATH Keywords

Extremal ProblemMinimal Number of Basic Elements in a Multiset Antichain

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05)

Related Items

The cubical poset is additive, A lower bound on the size of a complex generated by an antichain, Two new perspectives on multi-stage group testing, Minimum weight flat antichains of subsets, Multiset antichains having minimal downsets, Extremal problems in finite sets, Antichains in the set of subsets of a multiset

Cites Work

• Unnamed Item
• Unnamed Item
• The Kruskal-Katona method made explicit
• More on the generalized Macaulay theorem. II
• Inequalities concerning numbers of subsets of a finite set
• More on the generalized Macaulay theorem
• On the Divisors of a Number
• On subsets contained in a family of non-commensurable subsets of a finite set
• A generalization of a combinatorial theorem of macaulay
• A finite set covering theorem