Abstract: We consider a simplicial complex generaliztion of a result of Billera and Meyers that every nonshellable poset contains the smallest nonshellable poset as an induced subposet. We prove that every nonshellable -dimensional simplicial complex contains a nonshellable induced subcomplex with less than vertices. We also establish CL-shellability of interval orders and as a consequence obtain a formula for the Betti numbers of any interval order.
Recommendations
Cited in
(19)- Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness
- Completing and extending shellings of vertex decomposable complexes
- Completing and extending shellings of vertex decomposable complexes
- Results on the regularity of square-free monomial ideals
- On the topology of the permutation pattern poset
- Chains of modular elements and shellability
- Shedding vertices and ass-decomposable monomial ideals
- On well-covered, vertex decomposable and Cohen-Macaulay graphs
- An obstruction to moving multiples of subvarieties
- The sequentially Cohen-Macaulay property of edge ideals of edge-weighted graphs
- Decomposable clutters and a generalization of Simon's conjecture
- Chordal graphs, higher independence and vertex decomposable complexes
- Extending simplicial complexes: topological and combinatorial properties
- Vertex decomposability of complexes associated to forests
- On vertex decomposable and Cohen-Macaulay regular graphs
- Shellings from relative shellings, with an application to NP-completeness
- Some algebraic properties of \(t\)-clique ideals
- Shellable quasi-forests and their \(h\)-triangles
- Vertex decomposable graphs and obstructions to shellability
This page was built for publication: Obstructions to shellability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293353)
