ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a dd-regular graph with nn vertices, where d≥2d\geq 2. Its irregularity strength s(G)s(G) is the least positive integer kk for which there is a weighting ω:E(G)→{1,2,…,k}\omega:E(G)\to\{1,2,\ldots,k\} such that the weighted degrees

σω(v)=∑u∈NG(v)ω(uv)\sigma_\omega(v)=\sum_{u\in N_G(v)}\omega(uv)

are distinct for all vertices vv of GG. Faudree–Lehel conjecture. There exists an absolute constant CC such that

s(G)≤nd+C.s(G)\leq\frac{n}{d}+C.

The conjecture asks whether the lower bound of order n/dn/d 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.