Abstract
It is known that a lexicographically shellable poset is shellable, and it has been asked whether the two concepts are equivalent. We provide a counterexample, a shellable graded poset that is not lexicographically shellable.
Original language | English (US) |
---|---|
Pages (from-to) | 257-260 |
Number of pages | 4 |
Journal | Combinatorica |
Volume | 5 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1 1985 |
Keywords
- AMS subject classification (1980): 05C65, 06A10
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics