Alspach's rainbow matching conjecture for 2-factorizations

A $2$-factor is a spanning $2$-regular subgraph, and a full rainbow matching is a matching containing one edge from every color class. Alspach's conjecture. If $G$ is a simple $2d$-regular graph that is edge colored such that each color class is a $2$-factor, then $G$ has a full rainbow matching. The supplied passage says that only the strong asymptotic version was known in the cited discussion; it does not state a resolution of the exact conjecture.