On Homomorphism Graphs

Abstract

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for the construction comes from the adaptation of this method to the LOCAL model of distributed computing. Our approach unifies the previous results in the area, as well as produces new ones. In particular, we show that for $\Delta >2$ it is impossible to give a simple characterization of acyclic $\Delta$-regular Borel graphs with Borel chromatic number at most $\Delta$: such graphs form a ${\mathbf{\Sigma }}_2^1$-complete set. This implies a strong failure of Brooks'-like theorems in the Borel context.

References in corpus (9)

• A determinacy approach to Borel combinatorics
• Brooks's theorem for measurable colorings
• Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms
• Hyperfiniteness and Borel combinatorics
• Borel version of the Local Lemma
• Distributed Algorithms, the Lovász Local Lemma, and Descriptive Combinatorics
• Local Problems on Grids from the Perspective of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
• Minimal definable graphs of definable chromatic number at least three
• A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function