Almost Stacked Hypothesis

Place pebbles on the vertices of a graph. A move removes two pebbles from a vertex and puts one on a neighbor. Stacking means getting all remaining pebbles onto one vertex. Clearing means leaving exactly one. The critical Almost Stacked Hypothesis compares the thresholds for all placements and for placements where only one vertex may start with more than one pebble.

Why it matters and what counts as progress

Why it matters: Testing every placement can be much harder than testing almost-stacked ones. An equality of thresholds would justify using the more restricted family.

What counts as progress: Determine both thresholds for a specified graph or prove they agree on a class. Separate the critical formulation, which requires success at every larger size, from the printed pointwise question.

How the problem developed

  1. 2026 · Stacking and clearing questions [1]

    Tamás Csernák and Lajos Soukup Tamás Csernák and Lajos Soukup introduced the thresholds and proposed the Almost Stacked Hypothesis.

  2. 27 Oct 2026 · A nine-vertex counterexample [2]

    John Fairfax-Ball with AI assistance John Fairfax-Ball’s project published a graph where the critical thresholds differ for stacking and clearing, with the exact certificate checked in Lean.

AI contribution

Sources

  1. Stacking and clearing in graph pebbling
  2. The critical Almost Stacked Hypothesis fails on a nine-vertex graph
  3. Pinned theorem, provenance and checking record
  4. Csernák and Soukup’s Almost Stacked Hypothesis
Publication history