The minimal number of basic elements in a multiset antichain (Q1254998): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(78)90077-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048364936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Divisors of a Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite set covering theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a combinatorial theorem of macaulay / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the generalized Macaulay theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities concerning numbers of subsets of a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kruskal-Katona method made explicit / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the generalized Macaulay theorem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4096951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5805073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subsets contained in a family of non-commensurable subsets of a finite set / rank
 
Normal rank

Latest revision as of 00:33, 13 June 2024

scientific article
Language Label Description Also known as
English
The minimal number of basic elements in a multiset antichain
scientific article

    Statements

    Identifiers