A Δ¹_n-definable well-order of the reals for n≥2 implies that the projective chromatic number equals the classical chromatic number for all locally countable Δ¹_n-definable graphs, with a similar result for Δ¹_2 and Borel graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Projective Chromatic Numbers
A Δ¹_n-definable well-order of the reals for n≥2 implies that the projective chromatic number equals the classical chromatic number for all locally countable Δ¹_n-definable graphs, with a similar result for Δ¹_2 and Borel graphs.