simple_graph_triangle_degree
def
The 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 N(v) with u adjacent to w.
Statement
def simple_graph_triangle_degree {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V) : ℕ
- Defined in
- arXiv:2610.08478 (Regular K_3-Irregular Graphs of Every Regularity at Least Nine), Abstract and Sec. 1 (triangle-degree, the K_3-degree of a vertex).
- Verified
- 11 Oct 2026
- Axioms
- none listed
- Used by 15
- simple_graph_six_regular_no_triangle_degree_fourteenIn any 6-regular graph, no vertex has triangle-degree 14 if the graph is triangle-distinct.
- simple_graph_triangle_degree_complLet G be an r-regular simple graph on N vertices. For every vertex v, td_{Ḡ}(v) = C(N − r − 1, 2) − N r / 2 + r² − td_G(v), where Ḡ is the…
- simple_graph_triangle_degree_complete_fin_fourEvery vertex of K_4 lies in exactly 3 triangles.
- not_triangle_distinct_complete_fin_fourK_4 is not triangle-distinct.
- simple_graph_triangle_degree_botIn the empty graph every vertex has triangle-degree 0.
- 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.
- simple_graph_triangle_degree_le_choosetd_G(v) ≤ C(deg v, 2).
- 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.
- 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_distinctA graph is triangle-distinct (K_3-irregular) when its vertex triangle-degrees are pairwise distinct.
- 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…
Lean source view module on GitHub
/-- Triangle-degree of a vertex: the number of triangles of `G` through `v` (adjacent pairs inside the neighbourhood of `v`). -/ def simple_graph_triangle_degree {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (v : V) : ℕ := (((G.neighborFinset v).powersetCard 2).filter (fun s => ∀ x ∈ s, ∀ y ∈ s, x ≠ y → G.Adj x y)).card