The 1-2-3 Conjecture almost holds for regular graphs

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be possible from the weight set $\{1,2,3,4,5\}$. We show that for regular graphs it is sufficient to use weights $1$, $2$, $3$, $4$. Moreover, we prove the conjecture to hold for every $d$-regular graph with $d\geq 10^8$.