Inequalities concerning numbers of subsets of a finite set

DOI10.1016/0097-3165(74)90010-7zbMath0287.05018OpenAlexW2072589849MaRDI QIDQ1845734

G. F. Clements

Publication date: 1974

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(74)90010-7

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)

Related Items

The minimal number of basic elements in a multiset antichain, More on the generalized Macaulay theorem. II, Antichains in the set of subsets of a multiset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More on the generalized Macaulay theorem
• A minimization problem concerning subsets of a finite set
• 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
• On Existence of Distinct Representative Sets for Subsets of a Finite Set
• Sets of Lattice Points which Contain a Maximal Number of Edges