ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A total weighting is a function ω:E(G)∪V(G)→{1,2}\omega:E(G)\cup V(G)\to\{1,2\}, and its induced total vertex weight is

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

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

This is the total version of the 1-2-3 conjecture, formulated by Przybyło and Woźniak. The source notes that Kalkowski came close to settling it by allowing edge weights from {1,2,3}\{1,2,3\} and vertex weights from {1,2}\{1,2\}, but the two-valued total-weighting conjecture remains open.

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.