A new approach to Macaulay posets

DOI10.1016/S0097-3165(03)00017-7zbMath1057.06002OpenAlexW2040742945MaRDI QIDQ598449

Thomas J. Pfaff, Victor P. Piotrowski, Sergei L. Bezrukov

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0097-3165(03)00017-7

zbMATH Keywords

Macaulay posetmaximal rank ideal problemshadow minimization problem

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items (4)

On partitioning of hypergraphs ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ New infinite family of regular edge-isoperimetric graphs ⋮ The vertex isoperimetric problem for the powers of the diamond graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an equivalence in discrete extremal problems
• General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
• Characterizing profiles of \(k\)-families in additive Macaulay posets
• An edge-isoperimetric problem for powers of the Petersen graph
• Morphisms for the maximum weight ideal problem
• The edge-isoperimetric problem for discrete tori
• A local-global principle for vertex-isoperimetric problems
• A local-global principle for Macaulay posets
• The spider poset is Macaulay

This page was built for publication: A new approach to Macaulay posets