Minimal definable graphs of definable chromatic number at least three

  title={Minimal definable graphs of definable chromatic number at least three},
  author={Rapha{\"e}l Carroy and Benjamin D. Miller and David Schrittesser and Zolt{\'a}n Vidny{\'a}nszky},
  journal={Forum of Mathematics, Sigma},
Abstract We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we characterize the Borel graphs on standard Borel spaces of vertex-degree at most two with this property and show that the analogous result for digraphs fails. 

On Homomorphism Graphs

It is shown that for ∆ > 2 it is impossible to give a simple characterization of acyclic ∆-regular Borel graphs with Borel chromatic number at most ∆: such graphs form a Σ12-complete set, implying a strong failure of Brooks’-like theorems in the Borel context.


. We survey some recent results in the theory of measurable graph combinatorics. We also discuss applications to the study of hyperfiniteness and measurable equidecompositions.

A complexity problem for Borel graphs

We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on

$\Delta^1_1$ Effectivization in Borel Combinatorics

We develop a flexible method for showing that Borel witnesses to some combinatorial property of ∆11 objects yield ∆ 1 1 witnesses. We use a modification the Gandy–Harrington forcing method of proving



Analytic digraphs of uncountable Borel chromatic number under injective definable homomorphism

We study the analytic digraphs of uncountable Borel chromatic number on Polish spaces, and compare them with the notion of injective Borel homomorphism. We provide some minimal digraphs incomparable

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


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


Abstract We simultaneously generalize Silver’s perfect set theorem for co-analytic equivalence relations and Harrington-Marker-Shelah’s Dilworth-style perfect set theorem for Borel quasi-orders,

Finite versus infinite: An insufficient shift

The smooth ideal

We give a classical proof of the generalization of the characterization of smoothness to quotients of Polish spaces by Borel equivalence relations. As an application, we describe the extent to which

Borel version of the Local Lemma

We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying

On the existence of small antichains for definable quasi-orders

We generalize Kada’s definable strengthening of Dilworth’s characterization of the class of quasi-orders admitting an antichain of a given finite cardinality.

Borel Circle Squaring

We give a completely constructive solution to Tarski's circle squaring problem. More generally, we prove a Borel version of an equidecomposition theorem due to Laczkovich. If $k \geq 1$ and $A, B

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.