A minimization problem concerning subsets of a finite set

DOI10.1016/0012-365X(73)90074-5MaRDI QIDQ2559471zbMATH OpenFDO

Authors G. F. Clements

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

• A generalization of a combinatorial theorem of macaulay
• More on the generalized Macaulay theorem

Cited in

(20)

• Inequalities concerning numbers of subsets of a finite set
• Maximizing antichains in the cube with fixed size of a shadow
• Extremal problems for finite sets and convex hulls---a survey
• On multiset k-families
• An existence theorem for antichains
• On Sperner families in which no k sets have an empty intersection. III
• An extended Euler-Poincaré theorem
• On maximal antichains consisting of sets and their complements
• Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions
• On Sperner families in which no k sets have an empty intersection
• On Sperner families in which no k sets have an empty intersection. II
• Characterizing profiles of \(k\)-families in additive Macaulay posets
• Intersecting Sperner families and their convex hulls
• Sharpening the LYM inequality
• Antichains in the set of subsets of a multiset
• Polytopes determined by hypergraph classes
• On maximal antichains containing no set and its complement
• More on the generalized Macaulay theorem. II
• An Erdős-Ko-Rado theorem for multisets
• Some results on Sperner families

This page was built for publication: A minimization problem concerning subsets of a finite set

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