AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_triangle_distinct

def

A graph is triangle-distinct (K_3-irregular) when its vertex triangle-degrees are pairwise distinct.

Statement

def simple_graph_is_triangle_distinct {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Prop
Defined in
arXiv:2610.08478 (Regular K_3-Irregular Graphs of Every Regularity at Least Nine), Sec. 1 (triangle-distinct, or K_3-irregular, graphs).
Verified
11 Oct 2026
Axioms
none listed
Built on 1
  • simple_graph_triangle_degreeThe triangle-degree td_G(v): the number of triangles of G containing v, i.e. the number of 2-element subsets {u, w} of the neighbourhood…
Used by 14

Lean source view module on GitHub

def simple_graph_is_triangle_distinct {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Prop :=
  Function.Injective (simple_graph_triangle_degree G)
See it in the graphDiscuss this resultChallenge it