Asymptotic confirmation of the Faudree-Lehel Conjecture on irregularity strength for all but extreme degrees
Jakub Przyby{\l}o

TL;DR
This paper proves that the irregularity strength of regular graphs asymptotically matches the conjectured bound for most degrees, except for extremely small or large degrees, advancing understanding of graph irregularity measures.
Contribution
It establishes that the Faudree-Lehel conjecture holds asymptotically for a wide range of degrees in regular graphs, except for extreme cases.
Findings
Proves $s(G) o rac{n}{d}$ asymptotically for most degrees.
Shows the conjecture holds when $d$ is between logarithmic powers of $n$.
Provides bounds for irregularity strength for large $n$ and various degree ranges.
Abstract
The irregularity strength of a graph , , is the least admitting a -weighting of the edges of assuring distinct weighted degrees of all vertices, or equivalently the least possible maximal edge multiplicity in an irregular multigraph obtained of via multiplying some of its edges. The most well-known open problem concerning this graph invariant is the conjecture posed in 1987 by Faudree and Lehel that there exists a constant such that for each -regular graph with vertices and (while a straightforward counting argument yields ). The best known results towards this imply that for every -regular graph with vertices and , while if . We show that the conjecture of Faudree…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
