## Shellability is NP-complete

**Authors:** Thinh Nguyen

We prove that for every d≥2, deciding if a pure, d-dimensional, simplicial complex is
shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj
and Klee in 1978. Our reduction also yields that for every d≥2 and k≥0, deciding if a pure,
d-dimensional, simplicial complex is k-decomposable is NP-hard. For d≥ 3, both problems
remain NP-hard when restricted to contractible pure d-dimensional complexes. Another
simple corollary of our result is that it is NP-hard to decide whether a given poset is CL-
shellable.

**Comments:** 19 Pages.

**Download:** **PDF**

### Submission history

[v1] 2018-07-05 14:59:41

**Unique-IP document downloads:** 10 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary.
In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution.
Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*