ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph without isolated edges. A weighting of the edges is a function ω:E(G)→{1,2,3}\omega:E(G)\to\{1,2,3\}, and the induced vertex weight is

ω(v):=∑u∈N(v)ω(uv).\omega(v):=\sum_{u\in N(v)}\omega(uv).

The 1-2-3-Conjecture. For every graph GG without isolated edges, there is a weighting ω:E(G)→{1,2,3}\omega:E(G)\to\{1,2,3\} such that the induced vertex weights properly color V(G)V(G).

This conjecture concerns the existence of a three-valued edge weighting distinguishing the weighted degrees of adjacent vertices. It is known for several classes of graphs, while the best general result stated in the source uses weights from {1,2,3,4,5}\{1,2,3,4,5\} rather than {1,2,3}\{1,2,3\}; the conjecture remains open in general.

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.