Planar lattices are lexicographically shellable

DOI10.1007/BF00571187zbMath0761.06005OpenAlexW2009998170MaRDI QIDQ1198483

Karen L. Collins

Publication date: 16 January 1993

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00571187

zbMATH Keywords

simplicial complexespolynomial ringslexicographically shellableplanar latticeCohen- MacaulayEL-labelingleveled planarplanar posetsrank-connected

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Algebraic aspects of posets (06A11)

Related Items

Cartesian lattice counting by the vertical 2-sum ⋮ The Frobenius complex. ⋮ The distinguishing number and distinguishing chromatic number for posets

Cites Work

• Unnamed Item
• Interval graphs and interval orders
• Finite lattices and Jordan-Hölder sets
• Planar lattices and planar graphs
• Cohen-Macaulay quotients of polynomial rings
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Laying Out Graphs Using Queues
• Lattices with Doubly Irreducible Elements
• Efficient Planarity Testing
• Planar Lattices
• Which Spheres are Shellable?
• Partial orders of dimension 2
• Combinatorics and commutative algebra
• On the dimension of partially ordered sets

This page was built for publication: Planar lattices are lexicographically shellable