Pith. sign in

REVIEW 1 major objections 6 minor 17 references

Extendable shellability for $d$-dimensional complexes on $d+3$ vertices

T0 review · 1 major / 6 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves that every shellable $d$-dimensional complex on at most $d+3$ vertices is extendably shellable.

desk verdict The theorem is genuinely new and the threshold is sharp, but the printed proof applies the erasure-to-shelling dictionary to the wrong graph; the fix is elementary and the result is likely correct. read the letter →

arxiv 1908.07155 v2 pith:XOLMGYBF submitted 2019-08-20 math.CO math.ACmath.GT

Jared Culbertson , Anton Dochtermann , Dan P. Guralnik , Peter F. Stiller This is my paper · ORCID
classification math.COmath.ACmath.GT MSC 05E4513F5505C75
keywords shellablesimplicialcomplexextendablychordalgraphexposededgeerasuresequencelinearquotientsquadraticmonomialidealssimplexskeletonconjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves a sharp no-getting-stuck statement for simplicial complexes: if $X$ is a shellable $d$-dimensional complex with at most $d+3$ vertices, then any shelling of any subcomplex of $X$ can be extended to a shelling of all of $X$. Such complexes are called extendably shellable. The result includes, as a special case, the conjecture that every $k$-skeleton of a simplex is extendably shellable in the range $k=n-3$, and it generalizes an earlier theorem for $d$-spheres on $d+3$ vertices. The paper also shows the bound is best possible, since on $d+4$ vertices there are already shellable complexes that can get stuck.

What carries the argument

The central object is the exposed edge: an edge that lies in exactly one maximal clique of a graph, so that deleting it preserves chordality. The load-bearing mechanism is the dictionary of Lemma 2.2, equating erasure sequences of exposed edges with shelling steps of the complementary complex. Proposition 1.2, proved through Lemmas 3.1 to 3.4, shows that every chordal subgraph of a chordal graph can be reached by exposed-edge erasures. This reachability at the graph level is what carries the complex-level extension argument.

What would settle it

The cleanest test is graph-theoretic: take a chordal graph $G$ and a chordal subgraph $H$ on the same vertex set and try to reduce $G$ to $H$ by deleting only exposed edges; Proposition 1.2 predicts success for every such pair, so one unreachable pair would refute the method, and through the dictionary it would produce a shellable complex on $d+3$ vertices with an uncompletable partial shelling.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1: for every $d\geq 1$, a shellable $d$-dimensional simplicial complex on at most $d+3$ vertices is extendably shellable. The proof reduces this to a purely graph-theoretic statement. On $d+3$ vertices, each facet is a $(d+1)$-set whose complement is a pair of vertices, so facets correspond to edges of a graph. The dictionary of Lemma 2.2 identifies a shelling order with an erasure sequence in the complete graph $K_{d+3}$: at each step the erased edge is exposed, and the final graph is chordal. Proposition 1.2 then says that from any chordal graph one can keep erasing exposed edges until any prescribed chordal subgraph remains. Translating this back, a partial shelling of a subcomplex can always be completed to a shelling of the whole complex.

Load-bearing premise

The argument rests on an unproved dictionary lemma from earlier work identifying erasure sequences of edges with shelling steps of complementary facets; as written, the proof must apply it to the complementary graphs, so if that translation cannot be repaired the graph-theoretic proposition does not reach the complexes.

Editorial extensions

If this is right

  • Any shelling of a subcomplex of such an $X$ can be extended, so building $X$ by facets never gets stuck after a correct start.
  • The $k=n-3$ case of the simplex-skeleton conjecture follows as a corollary.
  • The theorem extends the known extendable shellability of $d$-spheres on $d+3$ vertices to all shellable complexes on that many vertices, not just spheres.
  • The bound is tight: on $d+4$ vertices there are shellable complexes that are not extendably shellable.
  • Since the cases with $d+1$ and $d+2$ vertices are straightforward, the entire statement is really about the $d+3$-vertex case.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The known non-extendably shellable examples in dimension 2 on six vertices sit exactly one vertex beyond the theorem's range, so they separate the boundary case from the next one; analyzing why the chordal-graph mechanism fails there could indicate what a $d+4$ proof would need.
  • Proposition 1.2 stands on its own as a constructive graph algorithm: any chordal graph can be reduced to any chordal subgraph by deleting exposed edges one at a time, a primitive that may be useful outside shelling.
  • A testable extension would be to replace edges by exposed circuits in higher-dimensional clutters and ask whether every shellable complex on $d+4$ vertices still has the extension property; the paper's conclusion notes the chordal-graph tools do not lift, so a positive answer would need a new invariant.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 6 minor

Summary. The paper proves that every shellable d-dimensional simplicial complex on at most d+3 vertices is extendably shellable. The proof translates shellings into erasure sequences of edges in complete graphs via Lemma 2.2, reducing the problem to a chordal-graph statement (Proposition 1.2) about obtaining a chordal subgraph from a chordal supergraph by removing exposed edges. The graph-theoretic part is proved self-contained in Section 3, while the bridge between shellings and erasures is imported from the authors' earlier work.

Significance. If the proof is corrected, this is a strong result: it establishes the k = n-3 case of Simon's conjecture and generalizes Kleinschmidt's theorem on d-spheres with d+3 vertices. The exposed-edge framework is clean, and the graph-theoretic heart (Lemmas 3.1--3.4) is self-contained and appears sound. However, the present submission contains a load-bearing complement-direction error in the application of Lemma 2.2 that invalidates the proof as written; the fix is straightforward and localized.

major comments (1)
  1. [Section 3, proof of Theorem 1.1 (second and third paragraphs)] The application of Lemma 2.2 inverts the complement. Lemma 2.2 states that an erasure sequence e_1,...,e_k in K_n resulting in a chordal graph G corresponds to shelling steps resulting in the complex X(G^C). Here the facets F_i = V \ e_i form a shelling of X, so the final complex is X, and hence the chordal graph produced by the erasure sequence is G(X)^C, not G(X). The paper instead sets H = G(X) and asserts 'By Lemma 2.2 the graph H is chordal'; this is not justified, and G(X) need not be chordal (for example, if the erasure sequence ends at K_3 ∪ K_2 on five vertices, then G(X) is K_{3,2}, which has an induced 4-cycle). Similarly, a partial shelling of Y corresponds to an erasure sequence ending in G(Y)^C, not G(Y), so the inclusion 'H ⊂ G' used to apply Proposition 1.2 has the wrong direction: the correct inclusion is G(X)^C ⊆ G(Y)^C. As printed, the proof of Theorem 1.1 does not go through. The fix is to run Proposition 1.2 with H = G(X)^C and G = G(Y)^C; both are chordal on the vertex set V, H ⊆ G holds, and Lemma 2.2 then converts the exposed-edge removals back into an extension of the partial shelling to a shelling of X.
minor comments (6)
  1. [Section 1, Proposition 1.2] The statement should specify that H and G have the same vertex set. As written, with the subgraph definition in Section 2 allowing V(H) ⊆ V(G), the statement is false: take G = K_3 and H = K_2 on two of its vertices. The proof of Proposition 1.2 uses Lemma 3.4, which assumes V(H) = V(G). Since the application in Theorem 1.1 does use the same vertex set, this is a statement-level fix rather than a fatal flaw.
  2. [Abstract] The first sentence contains a typo: 'alld' should be 'all d'.
  3. [Section 2, paragraph on simplicial vertices] The phrase 'if the subgraph induced on N(V) is a complete graph' should use N_G(v) rather than N(V).
  4. [Acknowledgements] The sentence 'We thank an anonymous referee who provided helpful comments on a earlier draft' should read 'on an earlier draft'.
  5. [Section 2, k-clutter notation] Reusing the symbol C for both a k-clutter and the simplicial complex it generates is confusing; consider distinguishing the two objects.
  6. [Section 2, Lemma 2.2] Lemma 2.2 is imported from [10] and is load-bearing for the main theorem. A brief proof sketch or a precise statement of the full theorem from [10] would improve the self-containedness of the paper.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the cited shelling–erasure dictionary is parameter-free and independent, and the graph-theoretic core is proved in-line.

full rationale

The derivation of Theorem 1.1 is a reduction: shelling steps on a d-complex with d+3 vertices are translated, via Lemma 2.2, into erasure sequences in K_{d+3}, and the target statement is then obtained from Proposition 1.2. Proposition 1.2 is proved self-contained in Section 3 using Lemmas 3.1–3.4, with no appeal to extendable shellability or to the conclusion of Theorem 1.1. Lemma 2.2 is imported from the authors' earlier work [10], so there is indeed a self-citation, but it is a parameter-free equivalence theorem whose statement does not assume the target result and whose proof is not replaced by the present paper. It is not fitted to any data, not a renamed consequence of Theorem 1.1, and not used to forbid alternatives. No equation in the paper is defined in terms of the claimed output, and no fitted parameter is relabeled as a prediction. There is an apparent graph-complement indexing issue in the printed proof of Theorem 1.1: the authors set H = G(X) and assert by Lemma 2.2 that H is chordal, whereas the lemma yields chordality of the graph remaining after erasing the edges V \ F_i, i.e. of the complement G(X)^C. This is a correctness or local-consistency concern for the proof as written, not a circular derivation, and the purported fix (run Proposition 1.2 with the complements) does not make the argument circular. Under the instruction not to confuse self-citation with circularity, the appropriate finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters or invented entities appear. The external inputs are prior theorems on chordal graphs and the shelling-erasure dictionary; the main graph deletion lemma is proved inside the paper.

assumptions (3)
  • standard math A graph is chordal if and only if it can be obtained from the complete graph by a sequence of erasures removing exposed edges.
    Invoked in Section 2 and used through Lemma 2.2; proved in the authors' earlier paper [7], not re-derived here.
  • standard math Lemma 2.2 from [10]: erasure sequences in K_n correspond exactly to shelling steps of the complementary (n-2)-clutter.
    This is the central dictionary translating between graph erasures and shellings. It is cited without proof and comes from prior work by one of the current authors.
  • standard math Induced subgraphs of chordal graphs are chordal.
    Used repeatedly in Lemma 3.4 when passing to G[N_G(z)] and G-z.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Extendable shellability for $d$-dimensional complexes on $d+3$ vertices." pith.science (2026). https://pith.science/paper/XOLMGYBF

@misc{pith2026190807155,
  author       = {Pith},
  title        = {Pith review of: Extendable shellability for $d$-dimensional complexes on $d+3$ vertices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XOLMGYBF}},
  note         = {Machine review of arXiv:1908.07155}
}
abstract

We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection to linear quotients of quadratic monomial ideals.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    Non-ridge-chordal complexes whose clique complex has shellable Alexander dual

    B. Benedetti, D. Bolognini, Non-ridge-chordal complexes whose clique complex has shellable Alexander dual , preprint (2019), arXiv.org/abs/1910.06755. 6

    work page Pith review arXiv 2019

  2. [2]

    Bigdeli, A

    M. Bigdeli, A. A. Yazdan Pour, R. Zaare-Nahandi,Decomposable clutters and a generalization of Simon’s conjecture, J. Algebra 531 (2019), pp. 102–124. 1, 6

    work page 2019

  3. [3]

    Bj¨orner, The homology and shellability of matroids and geometric lattices , in: N

    A. Bj¨orner, The homology and shellability of matroids and geometric lattices , in: N. White, ed., Matroid Applications (Cambridge Univ. Press, Cambridge, 1992), pp. 226–283. 2

    work page 1992

  4. [4]

    Bj¨orner, K

    A. Bj¨orner, K. Eriksson, Extendable shellability for rank 3 matroid complexes , Discrete Math. 132 (1994), pp. 373–376. 1

    work page 1994

  5. [5]

    Bj ¨orner, M

    A. Bj ¨orner, M. L. Wachs, Shellable nonpure complexes and posets I , Trans. Amer. Math. Soc. 348 (4) (1996) pp. 1299–1327. 1

    work page 1996

  6. [6]

    Bruggesser, P

    H. Bruggesser, P . Mani,Shellable decompositions of cells and spheres , Math. Scand. 29 (2) (1972), pp. 197–205. 1

    work page 1972

  7. [7]

    Edge Erasures and Chordal Graphs

    J. Culbertson, D. P . Guralnik, P . F. Stiller,Edge-erasures and chordal graphs , preprint arXiv:1706.04537 (2017). 1, 2, 3, 4

    work page Pith review arXiv 2017

  8. [8]

    Danaraj, V

    G. Danaraj, V . Klee, Shellings of spheres and polytopes , Duke Math. J. 41 (1974), pp. 443–451

    work page 1974

Show all 17 references
  1. [9]

    Danaraj, V

    G. Danaraj, V . Klee, Which spheres are shellable?, Ann. Discrete Math. 2 (1978), pp. 33–52. 1

    1978

  2. [10]

    Dochtermann, Exposed circuits, linear quotients, and chordal clutters , preprint, arXiv.org:1812.08128 (2018)

    A. Dochtermann, Exposed circuits, linear quotients, and chordal clutters , preprint, arXiv.org:1812.08128 (2018). 1, 2, 3, 6

    2018 arXiv

  3. [11]

    Goaoc, P

    X. Goaoc, P . Pat´ak, Z. Patakova, M. Tancer, U. Wagner,Shellability is NP-complete, 34th international symposium on computational geometry (SOCG), 2018, pp. 41:1–41:15. 1 EXTENDABLE SHELLABILITY FOR d-DIMENSIONAL COMPLEXES ON d +3 VERTICES 7

    2018

  4. [12]

    P . Kleinschmidt,Untersuchungen zur Struktur geometrischer Zellkomplexe insbesondere zur Schalbarkeit von p.l.-Sph¨ aren und p.l.-Kugeln, Habilitationsschrift, Ruhr-Universit¨at-Bohum, 1977. 1

    1977

  5. [13]

    Moriyama, F

    S. Moriyama, F. Takeuchi,Incremental construction properties in dimension two –shellability, extendable shellability and vertex decomposability, Discrete Math. 263 (2003), pp 295–296. 2

    2003

  6. [14]

    J. S. Provan, L. J. Billera, Decompositions of simplicial complexes related to diameters of convex polyhedra , Math. Oper. Res. 5 (1980), pp. 576–594. 1

    1980

  7. [15]

    D. J. Rose, R. E. Tarjan, and G. S. Lueker,Algorithmic aspects of vertex elimination on graphs , SIAM J. Comput. 5 (2): pp. 266–283, 1976. 3, 5

    1976

  8. [16]

    R. S. Simon, Combinatorial properties of cleanness , J. Algebra 167 (1994), pp. 361–388. 1

    1994

  9. [17]

    G. M. Ziegler, Shelling Polyhedral 3-Balls and 4-Polytopes , Discrete Comput. Geom. 19, Issue 2 (1998), pp. 159–174. 1 SENSORS DIRECTORATE , A IR FORCE RESEARCH LABORATORY , D AYTON , OH Email address: jared.culbertson@us.af.mil DEPARTMENT OF MATHEMATICS , TEXAS STATE UNIVERSI...

    1998

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.