Proof of the Goldberg–Seymour Conjecture on Edge–Colorings of Multigraphs.

Chen, G., Jing, G., & Zang, W. (2025). Proof of the Goldberg–Seymour Conjecture on Edge–Colorings of Multigraphs. Journal of Combinatorial Optimization, 025-01348.

Type

Journal article

Intellectual base

Primary research

Year

2025

DOI

10.1007/s10878-025-01348-6

Link

https://doi.org/10.1007/s10878-025-01348-6

Cited by

1 citation across 1 artifact.

Domain-specific

• Goldberg–Seymour Theorem
  • Chen, Jing, and Zang announced a proof in 2019, revised their manuscript, and published a proof in the Journal of Combinatorial Optimization in 2025.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:52e84cf3d41f · see in the full table