AFTD Auto-Formalizing Theoretical Domains

graph_pebbling_step

def

A 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 from u and one added at v.

Statement

def graph_pebbling_step {V : Type*} [DecidableEq V] (G : SimpleGraph V) (c c' : V → ℕ) : Prop
Defined in
arXiv:2610.09650 (The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem), Sec. 2 (pebbling step u ⇒ v).
Verified
12 Oct 2026
Axioms
none listed
Used by 8

Lean source view module on GitHub

/-- One pebbling step `c ⟶ c'` on `G`: along some edge `uv` with `c u ≥ 2`, remove two pebbles from `u` and add one to `v`. -/
def graph_pebbling_step {V : Type*} [DecidableEq V] (G : SimpleGraph V) (c c' : V → ℕ) : Prop :=
  ∃ u v, G.Adj u v ∧ 2 ≤ c u ∧ c' = Function.update (Function.update c u (c u - 2)) v (c v + 1)
See it in the graphDiscuss this resultChallenge it