Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Star 7-Edge-Colorability on Fin 10 Over C₁₀ or 2C₅ Base Cycles

Proved
OPG37271.subcubic_ten_canonical_01

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

combinatoricsedge-coloringgraph-theory

Every subcubic simple graph GGG on Fin 10\mathrm{Fin}\,10Fin10 containing the canonical 222-regular cycle base (type 01) admits a star 777-edge-coloring.

Preamble
import Definitions.Def_opg37271_star_edge_coloring

namespace OPG37271
Formal statement
theorem subcubic_ten_canonical_01 (G : SimpleGraph (Fin 10)) (hsub : IsSubcubic G)
    (hbase :
      (∀ p ∈ ([(0, 1), (0, 9), (1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 8), (8, 9)] : List (Fin 10 × Fin 10)), G.Adj p.1 p.2) ∨
      (∀ p ∈ ([(0, 1), (0, 4), (1, 2), (2, 3), (3, 4), (5, 6), (5, 9), (6, 7), (7, 8), (8, 9)] : List (Fin 10 × Fin 10)), G.Adj p.1 p.2)) :
    HasStarEdgeColoring G 7 := by sorry
end OPG37271
Source
Finite 10-vertex certificate slice for Dvořák, Mohar, and Šámal (2013), Section 4.

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