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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-13 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 Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000017 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.