AFTD Auto-Formalizing Theoretical Domains

five_vertex_t_star

def

The tree on 5 vertices with edges 0–1, 0–3, 0–4, 1–2: the path 3–0–1–2 with an extra leaf 4 attached at 0.

Statement

def five_vertex_t_star : SimpleGraph (Fin 5)
Source
step towards lly_positive_edge_connectivity_threshold_five
Verified
17 Oct 2026
Axioms
none listed
Used by 7

Lean source view module on GitHub

/-- The T-graph used as the non-degeneracy witness: edges 0-1, 0-3, 0-4, 1-2 on Fin 5. -/
def five_vertex_t_star : SimpleGraph (Fin 5) := SimpleGraph.fromRel (fun a b : Fin 5 =>
    (a = 0 ∧ b = 1) ∨ (a = 0 ∧ b = 3) ∨ (a = 0 ∧ b = 4) ∨ (a = 1 ∧ b = 2))
See it in the graphDiscuss this resultChallenge it