Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reducibility of a degree-2 vertex in a triangle for star 7-edge-coloring

Proved
OPG37271.hasStarEdgeColoring_of_triangle_deg_two

by kmehltretter82 · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsedge-coloringgraph-theory

Let GGG be a finite subcubic simple graph containing a triangle xyzxyzxyz in which zzz has degree at most 222. If G−xzG - xzG−xz admits a star 777-edge-coloring, then GGG also admits a star 777-edge-coloring.

Preamble
import Definitions.Def_opg37271_star_edge_coloring
import Mathlib.Combinatorics.SimpleGraph.DeleteEdges

universe u
namespace OPG37271
Formal statement
theorem hasStarEdgeColoring_of_triangle_deg_two {V : Type u} [Fintype V] {G : SimpleGraph V}
    (hsub : IsSubcubic G) (x y z : V)
    (hxz : G.Adj x z) (hyz : G.Adj y z) (hxy : G.Adj x y)
    (hz2 : (G.neighborSet z).encard ≤ 2)
    (hc' : HasStarEdgeColoring (G.deleteEdges {s(x, z)}) 7) :
    HasStarEdgeColoring G 7 := by sorry
end OPG37271
Source
Dvořák, Mohar, and Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313–326 (arXiv:1011.3376), Section 4, proof of Theorem 4.1(a) (degree-2 vertex with adjacent neighbors).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me