AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_triangle_distinct_decidable

instance

For a finite graph, the proposition that the vertex triangle-degrees are pairwise distinct is decidable.

Statement

instance simple_graph_is_triangle_distinct_decidable {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Decidable (simple_graph_is_triangle_distinct G)
Source
step towards exists_nonempty_regular_eight_triangle_distinct
Verified
20 Oct 2026
Axioms
none listed
Built on 2
Used by 2

Lean source view module on GitHub

/-- Triangle-distinctness of a graph on a finite vertex type is decidable. -/
instance simple_graph_is_triangle_distinct_decidable {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Decidable (simple_graph_is_triangle_distinct G) := inferInstanceAs (Decidable (Function.Injective (fun v => simple_graph_triangle_degree G v)))
See it in the graphDiscuss this resultChallenge it