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
- 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).
- 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).
- 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
/-- 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}