Metraipolis › archive › dc_b965c054eef7
Unfriendly partitions of locally finite Borel graphs — arXiv:2609.11919
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11919
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:16:21.514Z
- SHA-256 of the archived text
41f10f682051e64138306298d1479afb8437d10173af23d68f5af6458a7eea52- Stable URL of this page
https://metraipolis.com/documento/dc_b965c054eef7
How to cite
Unfriendly partitions of locally finite Borel graphs — arXiv:2609.11919 — arXiv (en), https://arxiv.org/abs/2609.11919 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b965c054eef7 (Metraipolis archive dc_b965c054eef7, sha256 41f10f682051e64138306298d1479afb8437d10173af23d68f5af6458a7eea52)
BibTeX
@misc{dcb965c054eef7,
title = {Unfriendly partitions of locally finite Borel graphs — arXiv:2609.11919},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11919},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b965c054eef7; sha256 41f10f682051e64138306298d1479afb8437d10173af23d68f5af6458a7eea52},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11919. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We answer in the negative the question of Thomas, recorded by Conley, Conley--Marks--Unger, and Conley--Tamuz, of whether every locally finite Borel graph admits a Borel unfriendly partition. Our counterexample has unbounded degree and is closed on a zero-dimensional Polish space; its connectedness relation is hyperfinite, and its components are bipartite and one-ended. Every unfriendly colouring is proper. Together with a parity obstruction, this rigidity rules out Baire measurable colourings that are unfriendly on a comeager set, and measurable colourings that are unfriendly almost everywhere for a quasi-invariant probability of finite average degree. In the positive direction, a Borel graph of maximum degree at most four admits a Borel unfriendly colouring whenever each component contains a cycle or a vertex of degree at most two. This reduces the Borel problem in maximum degree three to cubic forests and, with a theorem of Conley--Marks--Unger, gives Baire measurable unfriendly colourings for all Borel graphs of maximum degree at most four. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO). Categorie arXiv: Logic (math.LO) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.11919 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T05:59:08.330Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).