Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Star 7-edge-coloring for reduced bridgeless subcubic simple graphs

Open
OPG37271.subcubic_seven_color_of_reduced

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

combinatoricsedge-coloringgraph-theory

Every finite bridgeless subcubic simple graph GGG with no adjacent vertices of degree at most 222 and no degree-222 vertex whose neighbors are adjacent 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 subcubic_seven_color_of_reduced {V : Type u} [Fintype V] (G : SimpleGraph V)
    (hsub : IsSubcubic G)
    (hbridgeless : ∀ u v : V, G.Adj u v → (G.deleteEdges {s(u, v)}).Reachable u v)
    (hnoadj2 : ∀ u v : V, G.Adj u v → ¬ ((G.neighborSet u).encard ≤ 2 ∧ (G.neighborSet v).encard ≤ 2))
    (hnotri2 : ∀ x y z : V, G.Adj x z → G.Adj y z → G.Adj x y → ¬ (G.neighborSet z).encard ≤ 2) :
    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, Theorem 4.1(a).

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