The 1-2-Conjecture for total graph weightings
Statement
Let be a graph. A total weighting is a function , and its induced total vertex weight is
The 1-2-Conjecture. For every graph , there is a weighting such that the induced total vertex weights properly color .
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 and vertex weights from , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.