combinatorics / Combinatorial topology

Simon's Extendable Shellability Conjecture

Simon conjectured that every skeleton of a simplex is extendably shellable. False: for every $d \ge 3$ there is a pure $d$-dimensional shellable simplicial complex that is not shelling completable.

25Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsMay 23, 2026Significance 25/100Registry: site confirmed

Simon's Extendable Shellability Conjecture

Prior state unknowndisproved

Simon conjectured that every skeleton of a simplex is extendably shellable. False: for every $d \ge 3$ there is a pure $d$-dimensional shellable simplicial complex that is not shelling completable.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Simon conjectured that every skeleton of a simplex is extendably shellable. False: for every $d \ge 3$ there is a pure $d$-dimensional shellable simplicial complex that is not shelling completable.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.