The generalized Macaulay theorem, given by Clements and Lindström, is further generalized to the case where the underlying multiset is the union of k copies of the same multiset. This is used to give necessary and sufficient conditions for the existence of k-families with a prescribed number of members of given ranks.
Recommendations
Cites work
- A generalization of a combinatorial theorem of macaulay
- A generalization of the Kruskal-Katona theorem
- A minimization problem concerning subsets of a finite set
- An existence theorem for antichains
- Antichains in the set of subsets of a multiset
- Existence theorems for Sperner families
- scientific article; zbMATH DE number 3786783 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3518811 (Why is no real title available?)
- scientific article; zbMATH DE number 3636041 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- More on the generalized Macaulay theorem. II
- On maximal antichains containing no set and its complement
- On the average size of the sets in a Sperner family
Cited in
(6)- An extremal problem for antichains of subsets of a multiset
- The cubical poset is additive
- Characterizing profiles of \(k\)-families in additive Macaulay posets
- The normalized matching property from the generalized Macaulay theorem
- Completeness in multi metric spaces
- A generalization of the Kruskal-Katona theorem
This page was built for publication: On multiset k-families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106244)