Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 13 min ago
PreprintarXiv licencearXiv

The 1-2-3 Conjecture for Borel Combinatorics

  • Junhao Chen
  • Wei Dai
Open at sourcePDFDOICite

Abstract

The 1-2-3 Conjecture asserts that every finite graph without isolated edges admits edge weights from {1,2,3} such that the sum function forms a vertex coloring. We study its Borel analogue for locally finite Borel graphs without isolated edges, proving that five weights suffice in general and four suffice for regular graphs. We obtain three weights for acyclic graphs admitting a Borel selection of a nonempty finite set of ends from each component. We also obtain μ-measurable and Baire measurable vertex-coloring $3$-edge weightings from $3$-colorings of the same definability, under probability measure-preserving and Baire quasi-invariance conditions, respectively.

Related

  1. Spectral Theory and Descriptive Combinatorics for Non-Regular Borel pmp Graphs
    Cecelia Higgins, Pieter Spaas, Sofia Torelli
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  2. A bounded Borel set in the plane none of whose orthogonal projections is Borel
    Dmitrii Krokhalev
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Analog of Satake–Baily–Borel for period maps
    Mark Green, Phillip Griffiths, Colleen Robles
    European Journal of MathematicsPeer-reviewedLicence not statedFull text12 citedGeometry & topologyOpenAlex
  4. Realizations of Countable Borel Equivalence Relations
    Joshua Frisch, Alexander S. Kechris, Forte Shinko +1
    Memoirs of the American Mathematical SocietyPeer-reviewedLicence not statedFull text17 citedGeometry & topologyOpenAlex
  5. Finite-index extensions of essentially free countable Borel equivalence relations
    Jason Zesheng Chen
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv

Cite

BibTeXRIS
BibTeX
@misc{chen2026conjecture,
  title = {{The 1-2-3 Conjecture for Borel Combinatorics}},
  author = {Junhao Chen and Wei Dai},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03320},
  eprint = {2611.03320},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03320},
}
RIS
TY  - UNPB
TI  - The 1-2-3 Conjecture for Borel Combinatorics
AU  - Junhao Chen
AU  - Wei Dai
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03320
UR  - https://arxiv.org/abs/2611.03320
AB  - The 1-2-3 Conjecture asserts that every finite graph without isolated edges admits edge weights from {1,2,3} such that the sum function forms a vertex coloring. We study its Borel analogue for locally finite Borel graphs without isolated edges, proving that five weights suffice in general and four suffice for regular graphs. We obtain three weights for acyclic graphs admitting a Borel selection of a nonempty finite set of ends from each component. We also obtain μ-measurable and Baire measurable vertex-coloring $3$-edge weightings from $3$-colorings of the same definability, under probability measure-preserving and Baire quasi-invariance conditions, respectively.
ER  -