Partitionability is NP-complete
arXiv:2610.27083
Abstract
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.
arXiv comment14 pages; 4 figures