The minimal number of basic elements in a multiset antichain

DOI10.1016/0097-3165(78)90077-8MaRDI QIDQ1254998zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A finite set covering theorem
• A generalization of a combinatorial theorem of macaulay
• scientific article; zbMATH DE number 3518811 (Why is no real title available?)
• scientific article; zbMATH DE number 3065933 (Why is no real title available?)
• Inequalities concerning numbers of subsets of a finite set
• More on the generalized Macaulay theorem
• More on the generalized Macaulay theorem. II
• On subsets contained in a family of non-commensurable subsets of a finite set
• On the Divisors of a Number
• The Kruskal-Katona method made explicit

Cited in

(7)

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

This page was built for publication: The minimal number of basic elements in a multiset antichain

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