simple_graph_V3
def
For a finite type V with decidable equality and a simple graph G on V with decidable adjacency, simple_graph_V3 G is the finset of all vertices v in V whose degree in G is equal to 3.
Statement
def simple_graph_V3 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Finset V
- Defined in
- arXiv:2610.21868 Sec. 1
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 9
- op_310_partial_empty_V3Every subcubic finite simple graph with no degree-3 vertices admits a rich-neighbor 5-edge-coloring.
- maxDegree_induce_V3_le_two_iff_neighbor_filterFor any finite simple graph G, the induced subgraph on the vertices of degree 3 has maximum degree at most 2 if and only if every degree-3…
- op_310_partial_maxDegree_le_twoEvery finite simple graph with maximum degree at most 2 satisfies the Delta(G[V_3]) <= 2 condition and admits a rich-neighbor…
- complete_four_not_induce_V3_maxDegree_le_twoIn the complete simple graph on vertices Fin 4, the induced subgraph on the set of degree-3 vertices does not have maximum degree at most 2.
- subcubic_induce_V3_maxDegree_le_two_subgraphIf H is a subgraph of G, G is subcubic, and the induced subgraph on V3(G) has maximum degree at most 2, then H is also subcubic and the…
- maxDegree_induce_V3_le_two_iffFor any finite simple graph G with decidable adjacency on a finite type V with decidable equality, the induced subgraph on the set of…
- simple_graph_V3_botIn the empty simple graph on a finite type V with decidable equality, the finset of vertices of degree 3 is the empty finset.
- subcubic_induce_V3_le_two_induce_subsetIf the finite simple graph G has maximum degree at most 3 and Delta(G[V_3]) <= 2, then for every vertex subset S the induced subgraph G[S]…
- maxDegree_induce_V3_le_two_of_card_le_threeFor any finite simple graph G, if the number of vertices of degree 3 in G is at most 3, then the induced subgraph on the set of degree-3…
Read back from the Lean
Given a finite type V with decidable equality and a simple graph G on V with decidable adjacency, simple_graph_V3 G is defined as the Finset V of all vertices v : V whose degree in G is equal to 3 (that is, Finset.filter (fun v => G.degree v = 3) Finset.univ).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The finset of vertices of degree 3 in a finite simple graph. -/ def simple_graph_V3 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Finset V := Finset.univ.filter (fun v => G.degree v = 3)