The spider poset is Macaulay

DOI10.1006/jcta.1999.2994zbMath0951.06006OpenAlexW2090163613MaRDI QIDQ1976317

Robert Elsässer, Sergei L. Bezrukov

Publication date: 9 July 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5f8e160629df910f9eba76c2461869b6ca276a8c

zbMATH Keywords

Macaulay posetKruskal-Katona theoremshadow minimizationClements-Lindström theoremspider poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05) Algebraic aspects of posets (06A11)

Related Items

A new approach to Macaulay posets, On partitioning of hypergraphs, A Kruskal-Katona type theorem for integer partitions, On the orthogonal product of simplices and direct products of truncated Boolean lattices, Another generalization of Lindström's theorem on subcubes of a cube

Cites Work

• A new short proof for the Kruskal-Katona theorem
• On posets whose products are Macaulay
• On an equivalence in discrete extremal problems
• Bandwidth and density for block graphs
• A generalization of a combinatorial theorem of macaulay
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item