AFTD Auto-Formalizing Theoretical Domains

graph_leaf_rich_except

def

Every vertex other than r is either a leaf adjacent to a non-leaf different from r, or has at least two distinct leaf neighbors other than r.

Statement

def graph_leaf_rich_except {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (r : V) : Prop
Source
A structural class for the zero forcing unimodality question OP-1399, motivated by experiment 24666.
Verified
13 Nov 2026
Axioms
none listed
Used by 1
  • leaf_rich_except_zero_forcing_iffIn a graph leaf-rich away from r, a set is zero forcing exactly when it contains all but at most one leaf at each support, and either…

Lean source view module on GitHub

def graph_leaf_rich_except {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (r : V) : Prop := ∀ v : V, v ≠ r → (G.degree v = 1 ∧ ∃ u : V, u ≠ r ∧ G.Adj v u ∧ 2 ≤ G.degree u) ∨ (∃ x y : V, x ≠ y ∧ x ≠ r ∧ y ≠ r ∧ G.Adj v x ∧ G.Adj v y ∧ G.degree x = 1 ∧ G.degree y = 1)
See it in the graphDiscuss this resultChallenge it