graph_config_is_almost_stacked
def
A configuration c on a graph is almost stacked if at most one vertex carries more than one pebble, meaning there exists a vertex r such that every other vertex v ≠ r satisfies c(v) ≤ 1.
Statement
def graph_config_is_almost_stacked {V : Type*} (c : V → ℕ) : Prop
- Defined in
- arXiv:2610.09650 Def 3.1
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 1
- graph_config_is_almost_stacked_singleA configuration with all pebbles on a single vertex is almost stacked.
Read back from the Lean
For a type V and a configuration c : V → ℕ, graph_config_is_almost_stacked c asserts that there exists a vertex/element r : V such that for all v : V, if v ≠ r, then c v ≤ 1.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A pebbling configuration on a graph is almost stacked if at most one vertex carries more than one pebble. -/ def graph_config_is_almost_stacked {V : Type*} (c : V → ℕ) : Prop := ∃ r : V, ∀ v : V, v ≠ r → c v ≤ 1