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
- simple_graph_six_regular_no_triangle_degree_fourteenIn any 6-regular graph, no vertex has triangle-degree 14 if the graph is triangle-distinct.
- regular_eight_triangle_distinct_card_ge_sixteenEvery nonempty 8-regular triangle-distinct graph has at least 16 vertices, tightening the previous lower bound of 15.
- not_triangle_distinct_complete_fin_fourK_4 is not triangle-distinct.
- simple_graph_eight_regular_triangle_degree_le_twenty_fourIn any 8-regular triangle-distinct graph, the triangle-degree of every vertex is at most 24.
- regular_eight_triangle_distinct_card_ge_fifteenEvery 8-regular triangle-distinct graph with at least one vertex has at least 15 vertices: its complement is (n − 9)-regular and…
- card_le_twenty_nine_of_regular_eight_triangle_distinctEvery 8-regular triangle-distinct graph has at most 29 vertices: its triangle-degrees are pairwise distinct and each is at most C(8, 2) =…
- simple_graph_compl_regular_triangle_distinctIf G is an r-regular triangle-distinct graph on N vertices, its complement is an (N − r − 1)-regular triangle-distinct graph.
- eight_regular_triangle_distinct_certificateA computable boolean certificate checker for the regularity-8 witness problem: it returns true exactly when every one of the n vertices…
- card_le_twenty_five_of_regular_eight_triangle_distinctEvery 8-regular triangle-distinct graph has at most 25 vertices, since its vertex triangle-degrees are pairwise distinct elements of {0,…
- simple_graph_eight_regular_not_card_fifteenNo 8-regular triangle-distinct simple graph exists on 15 vertices.
- simple_graph_card_le_choose_add_one_of_regular_triangle_distinctAn r-regular triangle-distinct graph has at most C(r, 2) + 1 vertices: its triangle-degrees are pairwise distinct and lie in {0, …, C(r,…
- simple_graph_is_triangle_distinct_decidableFor a finite graph, the proposition that the vertex triangle-degrees are pairwise distinct is decidable.
- simple_graph_regular_eight_triangle_distinct_fin_fifteen_degreesIf G is an 8-regular triangle-distinct graph on the 15 vertices {0,…,14}, then the set of its vertex triangle-degrees is exactly…
- eight_regular_triangle_distinct_of_certificateIf the computable certificate checker accepts the edge list L on the n vertices {0,…,n−1}, then the graph of L is 8-regular and has…
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)