Delphi.science

The 1-2-3 conjecture with weights 1..5 (Kalkowski–Karoński–Pfender)

Source: github.com/VictorLiwentao/fc-palomar-proofs/tree/9b2a1eeaa6…

Wentao Li

Palomar Registrypalomar/PALOMAR-2026-11-13-000017Nov 13, 2026math.COscore 0

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.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-13-000017
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000017/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000017/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'