A minimization problem concerning subsets of a finite set

DOI10.1016/0012-365X(73)90074-5zbMath0257.05003MaRDI QIDQ2559471

G. F. Clements

Publication date: 1973

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items

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

Cites Work

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