On multiset k-families
type: Item
instance of: scholarly article
title: On multiset k-families
zbMATH Open document ID: 0651.05052
DOI: 10.1016/0012-365X(88)90013-1
author: G. F. Clements
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: 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.
reviewed by: Péter Komjáth
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A20
zbMATH DE Number: 4061290
zbMATH Keywords: shadow operator
zbMATH Keywords: Whitney numbers
zbMATH Keywords: Macaulay theorem
zbMATH Keywords: multiset
MaRDI profile type: Publication
cites work: A generalization of a combinatorial theorem of macaulay
cites work: A minimization problem concerning subsets of a finite set
cites work: More on the generalized Macaulay theorem. II
cites work: An existence theorem for antichains
cites work: Antichains in the set of subsets of a multiset
cites work: A generalization of the Kruskal-Katona theorem
cites work: On maximal antichains containing no set and its complement
cites work: Q4096951
cites work: Existence theorems for Sperner families
cites work: Q4196436
cites work: Q4071752
cites work: On the average size of the sets in a Sperner family
cites work: Q5726070
cites work: Q3964569
full work available at URL: 0012-365x(88)90013-1
OpenAlex ID: W1994761392
description: scientific article; zbMATH DE number 4061290