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