Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture (Q6117245)

Summary: Given a simple graph \(G\), the irregularity strength of \(G\), denoted \(s(G)\), is the least positive integer \(k\) such that there is a weight assignment on edges \(f: E(G) \to \{1, 2, \dots, k\}\) for which each vertex weight \(f^V(v):= \sum_{u: \{u, v\} \in E(G)} f (\{u ,v\})\) is unique amongst all \(v\in V(G)\). In [in: Combinatorics. Proceedings of the 7th Hungarian colloquium held from July 5 to July 10, 1987 in Eger, Hungary. Amsterdam etc.: North-Holland; Budapest: János Bolyai Mathematical Society. 247--256 (1988; Zbl 0697.05048)], \textit{R. J. Faudree} and \textit{J. Lehel} conjectured that there is a constant \(c\) such that \(s(G) \leqslant n/d + c\) for all \(d\)-regular graphs \(G\) on \(n\) vertices with \(d>1\), whereas it is trivial that \(s(G) \geqslant n/d\). In this short note we prove that the Faudree-Lehel Conjecture holds when \(d \geqslant n^{0.8+\epsilon}\) for any fixed \(\epsilon >0\), with a small additive constant \(c=28\) for \(n\) large enough. Furthermore, we confirm the conjecture asymptotically by proving that for any fixed \(\beta\in(0,1/4)\) there is a constant \(C\) such that for all \(d\)-regular graphs \(G, s(G) \leq \frac{n}{d}(1+\frac{C}{d^{\beta}})+28\), extending and improving a recent result of \textit{J. Przybyło} [J. Graph Theory 100, No. 1, 189--204 (2022; Zbl 1522.05406)] that \(s(G) \leq \frac{n}{d}(1+ \frac{1}{\ln^{\epsilon/19}n})\) whenever \(d\in [\ln^{1+\epsilon} n, n/\ln^{\epsilon}n]\) and \(n\) is large enough.