AFTD Auto-Formalizing Theoretical Domains

graph_stacking_number

def

The stacking number stack(G): the least integer t ≥ 2 such that every configuration of size t on G is stackable (0 by convention if there is none; the paper defines it for connected graphs, where it exists).

Statement

noncomputable def graph_stacking_number {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) : ℕ
Defined in
arXiv:2610.09650 (The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem), Definition 2.1 (stacking number). Defined here for every finite graph via sInf.
Verified
12 Oct 2026
Axioms
none listed
Built on 1
  • graph_config_stackableA configuration c on G is stackable if a sequence of pebbling steps (possibly empty) turns it into a stacked configuration, one whose…
Used by 4

Lean source view module on GitHub

/-- Stacking number of `G`: the least `t ≥ 2` such that every configuration of `t` pebbles on `G` is stackable. -/
noncomputable def graph_stacking_number {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) : ℕ :=
  sInf {t : ℕ | 2 ≤ t ∧ ∀ c : V → ℕ, ∑ v, c v = t → graph_config_stackable G c}
See it in the graphDiscuss this resultChallenge it