On lexicographically shellable posets

Anders Björner, Michelle Wachs

Research output: Contribution to journalArticlepeer-review

153 Scopus citations


Lexicographically shellable partially ordered sets are studied. A new recursive formulation of CL-shellability is introduced and exploited. It is shown that face lattices of convex polytopes, totally semimodular posets, posets of injective and normal words and lattices of bilinear forms are CL-shellable. Finally, it is shown that several common operations on graded posets preserve shellability and CL-shellability.

Original languageEnglish (US)
Pages (from-to)323-341
Number of pages19
JournalTransactions of the American Mathematical Society
Issue number1
StatePublished - May 1983

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics


Dive into the research topics of 'On lexicographically shellable posets'. Together they form a unique fingerprint.

Cite this