Every cycle of length n ≠ 5 admits a star 3-edge-coloring
ProvedOPG37271.cycle_ne_five_hasStarEdgeColoring_threecombinatoricsedge-coloringgraph-theory
For every integer with , the -vertex cycle graph admits a star -edge-coloring.
Preamble
import Definitions.Def_opg37271_star_edge_coloring namespace OPG37271
Formal statement
theorem cycle_ne_five_hasStarEdgeColoring_three (n : ℕ) (hn3 : 3 ≤ n) (hn5 : n ≠ 5) :
HasStarEdgeColoring (SimpleGraph.fromRel (fun i j : Fin n => (i.val + 1) % n = j.val)) 3 := by sorry
end OPG37271Source
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).