betaFeedback

WorksMathematics

Borel (2n+1)(2n+1)-coloring for bounded degree function graphs

Abstract

Let G=(X,E)G=(X,E) be a Borel graph generated by nn-many bounded-to-one Borel functions. We show that GG admits a Borel proper (2n+1)(2n+1)-coloring, which answers a problem of Kechris, Solecki and Todorčević.

Paper details

vlnc:W_aksmevse
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 6 Pro

View statement
Looking for related papers…