A Solution to the 1-2-3 Conjecture
Abstract
We show that for every graph without isolated edge, the edges can be assigned weights from 1,2,3 so that no two neighbors receive the same sum of incident edge weights. This solves a conjecture of Karo\'nski, Luczak, and Thomason from 2004.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.