Preprint
Oct 2026
Partitionability is NP-complete
We show that the problem of deciding whether a simplicial complex is partitionable is NP-complete in dimensions two and higher, answering a 1995 question of Kleinschmidt and Onn.
Russ Woodroofe
· 0 citations