The 1-2-3 conjecture for neighbor sum distinguishing edge weightings
Statement
Let be a nice graph, meaning a simple undirected graph with no component isomorphic to . For an integer edge weighting , define
The weighting is neighbor sum distinguishing when adjacent vertices receive distinct values of , and is the least such . The 1-2-3 conjecture. For every nice graph , . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.