Another generalization of the Kruskal-Katona theorem (Q1336454): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3741626 / 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: A generalization of the Kruskal-Katona theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3797242 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3752383 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5726070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of s-dimensional faces in a complex: An analogy between the simplex and the cube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The optimal number of faces in cubical complexes / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0097-3165(94)90104-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2057223790 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:12, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Another generalization of the Kruskal-Katona theorem |
scientific article |
Statements
Another generalization of the Kruskal-Katona theorem (English)
0 references
24 October 1994
0 references
Kruskal-Katona theorem
0 references
ranked poset
0 references
shadows
0 references
cardinality
0 references
algorithm
0 references
0 references