Goldberg's density conjecture

Let $G$ be a finite, undirected, loopless multigraph. Write $\Delta(G)$ for its maximum degree, $\chi'(G)$ for its chromatic index, and define its density by

$$\Gamma(G):=\max_{H\subseteq G,\ |H|\ge2}\left\lceil\frac{|E(H)|}{\lfloor |H|/2\rfloor}\right\rceil.$$

Goldberg's density conjecture. For any graph $G$, if $\Gamma(G)\le\Delta(G)-1$, then

$$\chi'(G)=\Delta(G).$$

The conjecture concerns when the maximum degree alone determines the chromatic index. The source notes that the Goldberg--Seymour conjecture has recently been confirmed, but does not state that this density conjecture itself has been resolved.