1-2-3 Conjecture for Borel combinatorics
Let be a locally finite Borel graph without isolated edges. Does there exist a Borel edge-weighting such that, defining for each , one has whenever ?
References
- The 1-2-3 Conjecture for Borel Combinatorics — arXiv — Junhao Chen, Wei Dai
Source: arXiv
Progress summary
A new preprint proves several partial versions of the Borel labeling problem, but neither this problem nor the underlying finite conjecture is solved.
The problem asks for a definable version of the finite -- Conjecture, originally posed by Karoński, Łuczak, and Thomason in 2004. Chen and Dai study edge-weightings of locally finite Borel graphs that distinguish the weighted degrees of adjacent vertices.
Recent Borel bounds
Chen and Dai claim five weights for general locally finite Borel graphs without isolated edges, four for regular graphs, and three when an acyclic finite-end selection is available; they also give measurable analogues. These are partial Borel results and do not settle the finite conjecture or the full Borel problem.
Current status (as of November 2026): Several Borel cases have claimed bounds, but the general Borel problem remains open and the cited claims have not been independently verified.
Sources
Solutions 0
No solutions have been posted yet.