Generalized recursive atom ordering and equivalence to CL-shellability
From MaRDI portal
Publication:6615506
DOI10.5070/C64163855zbMATH Open1547.05321MaRDI QIDQ6615506
Publication date: 8 October 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Combinatorics of partially ordered sets (06A07) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The uncrossing partial order on matchings is Eulerian
- Posets, regular CW complexes and Bruhat order
- Shelling the coset poset.
- On geometric semilattices
- Bruhat order of Coxeter groups and shellability
- General lexicographic shellability and orbit arrangements
- How to shell a monoid
- Lexicographic shellability for balanced complexes
- A partitioning and related properties for the quotient complex \(\Delta(B _{lm})/S_{l }S_m\)
- Combinatorics and commutative algebra.
- Shellability of face posets of electrical networks and the CW poset property
- On the shellability of the order complex of the subgroup lattice of a finite group
- Combinatorics of Coxeter Groups
- On Lexicographically Shellable Posets
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Lectures on Polytopes
- Shellable nonpure complexes and posets. II
- Shellable Nonpure Complexes and Posets. I
- The Laplacian on planar graphs and graphs on surfaces
- Shellability of exponential structures
This page was built for publication: Generalized recursive atom ordering and equivalence to CL-shellability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615506)
