# BOREL CHROMATIC NUMBERS

```@article{Kechris1999BORELCN,
title={BOREL CHROMATIC NUMBERS},
author={Alexander S. Kechris and Slawomir Solecki and Stevo Todorcevic},
year={1999},
volume={141},
pages={1-44}
}```
• Published 15 January 1999
• Mathematics
• Advances in Mathematics
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 metrizable space equipped with its σ-algebra of Borel sets), and the edge relation R ⊆ X^2 is "definable", i.e., Borel, analytic, co-analytic, etc. A Borel n-coloring of such a graph, where 1⩽ n ⩽ N_0 , is a Borel map c: X → Y with card(Y)=n, such that xRy⇒c(x) ≠ {c( y). If such a Borel coloring…
186 Citations

### A bound on measurable chromatic numbers of locally finite Borel graphs

• Mathematics
• 2016
A graph on a set X is an irreflexive, symmetric set G ⊆ X ×X. Such a graph is locally finite if every point has only finitely many G-neighbors. A (κ-)coloring of such a graph is a function c : X → κ

### An antibasis result for graphs of infinite Borel chromatic number

• Mathematics
• 2014
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.

### 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

### Borel chromatic numbers of graphs of commuting functions

• Mathematics
Fundamenta Mathematicae
• 2021
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

### Measurable chromatic numbers

It is shown 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 and that “the” minimum analytic graph with uncountable Borel (and Baire measurable) chromatic number holds.

### Hyperfiniteness and Borel combinatorics

• Mathematics
Journal of the European Mathematical Society
• 2019
We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the

### Two dichotomy theorems on colourability of non-analytic graphs

We prove: Theorem 1. Let κ be an uncountable cardinal. Every κ-Suslin graph G on reals satisfies one of the following two requirements: (I) G admits a (κ+ 1)-Borel colouring by ordinals below κ; (II)

### Borel combinatorics of locally finite graphs

Some basic tools and results on the existence of Borel satisfying assignments: Borel versions of greedy algorithms and augmenting procedures, local rules, Borel transversals, etc are presented.

### Clopen Graphs

A graph G on a topological space X as its set of vertices is clopen if the edge relation of G is a clopen subset of X2 without the diagonal. We study clopen graphs on Polish spaces in terms of their