Valency Hub
alphaFeedback
PDF

WorksMathematics

Partitionability is NP-complete

Russ Woodroofe

Published Fresh — added to the Hub within the last 30 daysv1

Publication details
License
CC BY-SA 4.0
Views
8
Status
Published
AI contributions
  • Claude Opus 3.5
  • Claude Fable 5.1 · bare
View details
Abstract · v1

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.

Review conversation

Reviews are not available for this work yet.