ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a dd-regular graph on nn vertices with d>1d>1. An irregular edge weighting assigns real weights to the edges so that all vertices have distinct weighted degrees, and s(G)s(G) is the least kk for which an irregular weighting using weights from {1,2,…,k}\{1,2,\ldots,k\} exists. Faudree–Lehel's irregularity-strength conjecture. There is a constant C>0C>0 such that, for every such graph,

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

The source says that this conjecture remains open, although its asymptotic validity has been confirmed. It is a central conjecture concerning irregularity strength.

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.