arXiv · 2611.19846
Borel $(2n+1)$-coloring for bounded degree function graphs
Abstract
Let $G=(X,E)$ be a Borel graph generated by $n$-many bounded-to-one Borel functions. We show that $G$ admits a Borel proper $(2n+1)$-coloring, which answers a problem of Kechris, Solecki and Todorčević.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Junhao Chen. 2026-11-15. Borel $(2n+1)$-coloring for bounded degree function graphs. https://searcharxiv.com/abs/2611.19846
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.