Measurable chromatic numbers

We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [N]N , although its Borel chromatic number is 0. We also show that if add(null) = c, then the universally measurable chromatic number of every treeing of a measure amenable equivalence relation is at most three. In particular, this holds for "the" minimum analytic graph G0 with uncountable Borel (and Baire measurable) chromatic number. In contrast, we show that for all {2, 3, . . . , 0, c}, there is a treeing of E0 with Borel and Baire measurable chromatic number . Finally, we use a Glimm-Effros style dichotomy theorem to show that every basis for a non-empty initial segment of the class of graphs of Borel functions of Borel chromatic number at least three contains a copy of (R<N , ).

• Type: Journal
• Year: 2008
• Where: JSYML
• Authors: Benjamin D. Miller
• Keywords: Borel Chromatic Number, Chromatic Number, JSYML 2008, Measurable Chromatic Number