Cao–Chen edge-decomposition conjecture
For every finite loopless multigraph with maximum degree and edge-chromatic number , where , there exist spanning Class I subgraphs and such that is the disjoint union of and , and and .
References
- Decomposing multigraphs into two Class I subgraphs with prescribed maximum degrees — arXiv — Yonglei Chen, Yan Cao
Source: arXiv
Progress summary
A 2026 preprint claims the conjectured decomposition is proved for finite loopless multigraphs, but the claim has not been independently checked.
The tracked assertion concerns decomposing a finite loopless multigraph with edge-chromatic number into two class-I subgraphs of maximum degrees and . The 2023 paper by Cao, Jing, Luo, Mkrtchyan, Zhang, and Zhao proves this formulation and identifies it as a variation of the Mkrtchyan–Steffen conjecture.
Known results
- For , the cited 2023 paper states the decomposition into class-I subgraphs with maximum degrees and ; it also proves a broader decomposition with the second maximum degree at most the edge multiplicity.
October 15, 2026 reported proof
A preprint by Yonglei Chen and Yan Cao is reported as establishing the conjectured two-subgraph decomposition throughout the stated range. The retrieved evidence contains no independent assessment, and the source itself is unrefereed. The paper’s broader Conjecture 4.1, allowing arbitrary with , was not reported as proved.
Current status (as of October 2026): The stated two-subgraph formulation is claimed proved for finite loopless multigraphs, but that claim is supported only by an unrefereed preprint; the broader formulation remains open in the retrieved evidence.
Sources
Solutions 0
No solutions have been posted yet.