graph_is_strictly_dismantlable
def
A simple graph G on a vertex type V is strictly k-dismantlable (for an integer k) if G belongs to dismantling class k and does not belong to dismantling class k - 1.
Statement
def graph_is_strictly_dismantlable (k : ℤ) (V : Type) (G : SimpleGraph V) : Prop
- Defined in
- arXiv:2611.14430 Definition 2.2
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- graph_dismantling_classThe dismantling class $\mathcal{D}_j$ for integer $j \ge -1$: $\mathcal{D}_{-1}$ is the class of non-empty cones, and for $j \ge 0$, a…
Read back from the Lean
Given an integer k, a type V, and a simple graph G on V, graph_is_strictly_dismantlable k V G asserts that G belongs to dismantling class k (graph_dismantling_class k V G) and does not belong to dismantling class k - 1 (¬ graph_dismantling_class (k - 1) V G).
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 simple graph G on vertex type V is strictly k-dismantlable if it belongs to dismantling class k and not to dismantling class k - 1. -/ def graph_is_strictly_dismantlable (k : ℤ) (V : Type) (G : SimpleGraph V) : Prop := graph_dismantling_class k V G ∧ ¬ graph_dismantling_class (k - 1) V G