For every even d>4, deleting one edge from K_(d+1) gives a graph with circular chromatic index d+1.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every even d>4, deleting one edge from K_(d+1) gives a graph with circular chromatic index d+1. Open residue: First unchecked even degrees above 12.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 4/5
Verified for d=6,8,10,12; each next even d is a finite rational-coloring optimization problem.
- finite witness
- 4/5
- oracle cost
- 4/5
- freshness
- 5/5
- seedability
- 4/5
Verification note
SAT/MILP over circular edge colorings, with either a coloring below d+1 or an infeasibility certificate. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.