The minimal number of basic elements in a multiset antichain
type: Item
instance of: scholarly article
title: The minimal number of basic elements in a multiset antichain
zbMATH Open document ID: 0401.05003
DOI: 10.1016/0097-3165(78)90077-8
author: G. F. Clements
published in: Journal of Combinatorial Theory. Series A
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3621719
zbMATH Keywords: Minimal Number of Basic Elements in a Multiset Antichain
zbMATH Keywords: Extremal Problem
MaRDI profile type: Publication
full work available at URL: 0097-3165(78)90077-8
OpenAlex ID: W2048364936
cites work: On the Divisors of a Number
cites work: A finite set covering theorem
cites work: A generalization of a combinatorial theorem of macaulay
cites work: More on the generalized Macaulay theorem
cites work: Inequalities concerning numbers of subsets of a finite set
cites work: The Kruskal-Katona method made explicit
cites work: More on the generalized Macaulay theorem. II
cites work: Q4096951
cites work: Q5805073
cites work: On subsets contained in a family of non-commensurable subsets of a finite set
description: scientific article; zbMATH DE number 3621719