Measurable chromatic numbers

@article{Miller2008MeasurableCN,
  title={Measurable chromatic numbers},
  author={Benjamin D. Miller},
  journal={Journal of Symbolic Logic},
  year={2008},
  volume={73},
  pages={1139 - 1157}
}
  • B. D. Miller
  • Published 1 December 2008
  • Mathematics
  • Journal of Symbolic Logic
Abstract 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 [ℕ]ℕ, 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… 
Borel chromatic numbers of graphs of commuting functions
Let D = (X,D) be a Borel directed graph on a standard Borel space X and let χB(D) be its Borel chromatic number. If F0, . . . , Fn−1 : X → X are Borel functions, let DF0,...,Fn−1 be the directed
Definable Combinatorics of Graphs and Equivalence Relations
Let D = (X, D) be a Borel directed graph on a standard Borel space X and let χB(D) be its Borel chromatic number. If F0, …, Fn-1: X → X are Borel functions, let DF0, …, Fn-1 be the directed graph
An antibasis result for graphs of infinite Borel chromatic number
A graph on a set X is a symmetric, irreflexive subset of X ×X. For a graph G on X, we let degG(x) = |{y ∈ X : (x, y) ∈ G}|. If degG(x) is countable for all x ∈ X we say that G is locally countable.
Borel Colouring Bad Rays
Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic
Measurable chromatic and independence numbers for ergodic graphs and group actions
We study in this paper combinatorial problems concerning graphs generated by measure preserving actions of countable groups on standard measure spaces. In particular we study chromatic and
A Cantor--Bendixson dichotomy of domatic partitions
Let Γ = ∏ i ∈ N Γ i be an infinite product of nontrivial finite groups, or let Γ = ( R / Z ) n be a finite-dimensional torus. For a countably infinite set S ⊆ Γ , an ℵ 0 -domatic partition is a partial ℵ
Weak Borel chromatic numbers
TLDR
It is consistent with an arbitrarily large size of the continuum that every closed graph on a Polish space either has a perfect clique or has a weak Borel chromatic number of at most ℵ1.
MEASURABLE 3-COLORINGS OF ACYCLIC GRAPHS
This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona. Our main result here is that acyclic locally finite analytic graphs on Polish

References

SHOWING 1-10 OF 18 REFERENCES
BOREL CHROMATIC NUMBERS
We study in this paper graph coloring problems in the context of descriptive set theory. We consider graphs G=(X, R), where the vertex set X is a standard Borel space (i.e., a complete separable
The structure of hy-per nite Borel equivalence relations
We study the structure of the equivalence relations induced by the orbits of a single Borel automorphism on a standard Borel space. We show that any two such equivalence relations which are not
Ends of graphed equivalence relations, I
Given a countable Borel equivalence relation E on a Polish space, we show: (1) E admits an endless graphing if and only if E is smooth; (2) E admits a locally finite single-ended graphing if and only
Additivity of measure implies additivity of category
In this paper it is proved that 2'-additivity of category follows from 2'-additivity of measure, and a combinatorial characterization of additivity of measure is found. DEFINITIONS. For abbreviation
Descriptive Kakutani equivalence
We consider a descriptive set-theoretic analog of Kakutani equivalence for Borel automorphisms of Polish spaces. Answering a question of Nadkarni, we show that up to this notion, there are exactly
Basis theorems for non-Potentially closed Sets and graphs of uncountable Borel chromatic number
We show that there is an antichain basis for neither (1) the class of non-potentially closed Borel subsets of the plane under Borel rectangular reducibility nor (2) the class of analytic graphs of
A Glimm-Effros dichotomy for Borel equivalence relations
A basic dichotomy concerning the structure of the orbit space of a transformation group has been discovered by Glimm [G12] in the locally compact group action case and extended by Effros [E 1, E2] in
Means on equivalence relations
Suppose that X is a Polish space and E is a countable Borel equivalence relation on X. We show that if there is a Borel assignment of means to the equivalence classes of E, then E is smooth. We also
Countable Borel Equivalence Relations
This paper develops the foundations of the descriptive set theory of countable Borel equivalence relations on Polish spaces with particular emphasis on the study of hyper-finite, amenable, treeable
BOREL AUTOMORPHISMS WITH NO FINITE INVARIANT MEASURE
An uncountable family of non-isomorphic Borel automorphisms which do not preserve any finite measure is presented.
...
...