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
- path_graph_two_stacking_number_eq_tree_estimateConjecture 5.6 (OP-144) holds for the path on two vertices: stack(P₂) = estim(P₂) (both equal 3).
- star_graph_one_stacking_number_eq_tree_estimateConjecture 5.6 (OP-144) holds for the single-vertex tree K₁: stack(K₁) = estim(K₁) (both equal 2).
- not_graph_config_stackable_zeroThe empty configuration is not stackable: no step applies and its support is empty.
- graph_config_stackable_singleA configuration with m ≥ 1 pebbles all on one vertex is stackable (it is already stacked).
- path_graph_three_stacking_number_eq_tree_estimateConjecture 5.6 (OP-144) holds for the path on three vertices: stack(P₃) = estim(P₃) (both equal 7).
- graph_stacking_numberThe 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…
- star_graph_four_stacking_number_eq_tree_estimateConjecture 5.6 (OP-144) holds for the star K₁,₃ (center 0, leaves 1, 2, 3), the smallest tree that is not a path: stack(K₁,₃) =…
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