no. 16 · Tuesday 17 November 2026
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ć.
- fields
- Logic, Combinatorics