Skip to main content

Lexicographic Shellability

  • Chapter
  • 3633 Accesses

Part of the book series: Algorithms and Computation in Mathematics ((AACIM,volume 21))

Lexicographic shellability is an important tool for studying the topological properties of the order complexes of partially ordered sets. Although, as we shall see in Remark 12.4, discrete Morse theory is more powerful as a method, shellability may still be useful in concrete applications. We take a detailed look at this concept in this section.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Lexicographic Shellability. In: Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71962-5_12

Download citation

Publish with us

Policies and ethics