AFTD Auto-Formalizing Theoretical Domains

graph_config_stackable

def

A configuration c on G is stackable if a sequence of pebbling steps (possibly empty) turns it into a stacked configuration, one whose support is a single vertex.

Statement

def graph_config_stackable {V : Type*} [DecidableEq V] (G : SimpleGraph V) (c : V → ℕ) : Prop
Defined in
arXiv:2610.09650 (The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem), Definition 2.1 (stacked, stackable).
Verified
12 Oct 2026
Axioms
none listed
Built on 1
  • graph_pebbling_stepA pebbling step on a graph G turns the configuration c : V → ℕ into c' when some edge uv has c(u) ≥ 2 and c' is c with two pebbles removed…
Used by 7

Lean source view module on GitHub

/-- `c` is stackable on `G`: some configuration reachable from `c` by pebbling steps has support exactly one vertex. -/
def graph_config_stackable {V : Type*} [DecidableEq V] (G : SimpleGraph V) (c : V → ℕ) : Prop :=
  ∃ c', Relation.ReflTransGen (graph_pebbling_step G) c c' ∧
    ∃ v, 0 < c' v ∧ ∀ w, w ≠ v → c' w = 0
See it in the graphDiscuss this resultChallenge it