ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a nice graph, meaning a simple undirected graph with no component isomorphic to K2K_2. For an integer edge weighting w:E(G)→{1,2,…,k}w:E(G)\rightarrow\{1,2,\ldots,k\}, define

σe(v):=∑e∋vw(e).\sigma^{e}(v):=\sum_{e\ni v}w(e).

The weighting is neighbor sum distinguishing when adjacent vertices receive distinct values of σe\sigma^{e}, and χe(G)\chi^{e}(G) is the least such kk. The 1-2-3 conjecture. For every nice graph GG, χe(G)≤3\chi^{e}(G)\leq 3. The conjecture asserts the best possible universal bound, since some nice graphs require weight 3. Its validity remains open in the source.

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.