{"id":"palomar/PALOMAR-2026-11-13-000017","url":"https://github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6d00172a8e08351ed43b896e21ce950","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000017-v1.json","repo":"https://github.com/VictorLiwentao/fc-palomar-proofs","tags":["math.CO","msc:05C15","msc:05C78"],"score":0,"title":"The 1-2-3 conjecture with weights 1..5 (Kalkowski–Karoński–Pfender)","trust":"high","domain":"math.CO","source":"palomar","authors":["Wentao Li"],"reviews":0,"subject":"math.CO","summary":"Every finite simple graph without an isolated edge has edge weights in {1,...,5} such that adjacent vertices have different weighted degrees (Kalkowski, Karoński and Pfender 2010). The {1,...,30} bound of Addario-Berry et al. (2007) follows as a corollary. The 1-2-3 conjecture itself (Karoński, Łuczak and Thomason 2004), with weights {1, 2, 3}, was later proved by Keusch (2024); this entry formalizes the earlier {1,...,5} theorem, not Keusch's proof.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"Vertex-coloring edge-weightings: towards the 1-2-3-conjecture","identifier":"doi:10.1016/j.jctb.2009.06.002","relationship":"formalizes"}]}