Faudree–Lehel conjecture on the irregularity strength of regular graphs
Statement
Let be a -regular graph with vertices, where . Its irregularity strength is the least positive integer for which there is a weighting such that the weighted degrees
are distinct for all vertices of . Faudree–Lehel conjecture. There exists an absolute constant such that
The conjecture asks whether the lower bound of order for regular graphs is asymptotically sharp up to an additive constant. The source describes this as a longstanding open problem, while known general bounds give a constant-factor estimate.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.