Goldberg–Seymour Conjecture

In graph theory, the Goldberg–Seymour conjecture states that, for a multigraph $G$

: $\operatorname(G) \leq \max(1 + \operatorname(G),\, \operatorname(G))$

where $\operatorname(G)$ is the edge chromatic number of ''G'', $\operatorname(G)$ is its maximum degree, and

: $\operatorname G = \max_ \frac.$

This above quantity is twice the arboricity of ''G''. It is sometimes called the density of ''G''.

Here, ''G'' can be a multigraph and can have loops. For simple graphs, this result follows from Vizing's theorem.

Background

It is already known that for loopless ''G'' (but can have parallel edges):

: $\operatorname G \geq \max(\operatorname G, \lceil \operatorname G \rceil).$

When does equality not hold? It does not hold for the Petersen graph. It is hard to find other examples. It is currently unknown whether there are any planar graphs for which equality does not hold.

This conjecture is named after Mark K. Goldberg of Rensselaer Polytechnic Institute and Paul Seymour of Princeton University, who arrived to it independently of Goldberg.

Announced proof

In 2019, an alleged proof was announced by Chen, Jing, and Zang in the paper. Part of their proof was to find a suitable generalization of Vizing's theorem (which says that for simple graphs $\operatorname G \leq 1 + \operatorname G$) to multigraphs. In 2023, Jing
announced a new proof with a polynomial-time edge coloring algorithm achieving the conjectured bound.

See also

* Petersen graph#Coloring
* Fractional coloring
* Graph coloring

References

{{DEFAULTSORT:Goldberg-Seymour conjecture
Graph coloring
Conjectures