Schrijver's rainbow path conjecture

Let $G$ be a $d$-regular graph. A proper edge-coloring is an edge-coloring in which adjacent edges receive distinct colors, and a path is rainbow if all its edges have distinct colors.

Schrijver's conjecture. If $G$ is a properly edge-colored $d$-regular graph, then $G$ contains a rainbow path of length $d-1$.

The source says this conjecture strengthens an earlier conjecture of Andersen and that the directed question discussed immediately before it is a significant strengthening. It also notes that Schrijver's conjecture has been asymptotically resolved, but does not state that the exact conjecture is solved.