A Solution to the 1-2-3 Conjecture: Every Finite Graph Without a K2 Component Has an Edge-Weighting from {1,2,3} Whose Weighted Degrees Properly Color the VerticesResearch Paper
Many graph-colouring questions ask whether a proper colouring can be produced indirectly, from local data, instead of being assigned vertex by vertex. In the 1-2-3 Conjecture, the colours are produced by weighting the edges of a graph and colouring each vertex with the sum of the weights at it. Karoński, Łuczak and Thomason asked in 2004 whether weights…