Related papers: Borel Edge Colorings for Finite Dimensional Groups

We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…

We prove that for any countable finite dimensional CAT(0) cube complex, the Borel median graph on its Roller compactification has the Borel asymptotic dimension bounded from above by its dimension.

In this paper we consider the Borel combinatorics of Schreier graphs of $\mathbb{Z}$-actions with arbitrary finite generating sets. We formulate the Borel combinatorics in terms of existence of Borel equivariant maps from…

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and…

We construct bounded degree acyclic Borel graphs with large Borel chromatic number using a graph arising from Ramsey theory and limits of expander sequences.

Let $\Gamma$ be a countable group and let $G$ be the Schreier graph of the free part of the Bernoulli shift of $\Gamma$ (with respect to some finite subset $F \subseteq \Gamma$). We show that the Borel fractional chromatic number of $G$ is…

We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $\Delta(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be…

We study Borel polychromatic colorings of grid graphs arising from free Borel actions of $\mathbb{Z}^d$. A polychromatic coloring is one in which every unit $d$-dimensional cube sees all available colors. In the classical setting, every…

We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$. The ``approximate'' version states that, for any Borel probability…

In this paper, we determine the asymptotic dimension for all surface braid groups -- including those associated with non-orientable and infinite-type surfaces -- as well as for torsion-free poly-finitely generated surface groups. We…

In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We show that various uncountable Borel chromatic numbers of…

We study the free part of the Bernoulli action of $\mathbb{Z}^n$ for $n\geq 2$ and the Borel combinatorics of the associated Schreier graphs. We construct orthogonal decompositions of the spaces into marker sets with various additional…

Let $G$ be a Borel graph all of whose finite subgraphs embed into the $d$-dimensional grid with diagonals. We show that then $G$ itself admits a Borel embedding into the Schreier graph of a free Borel action of $\mathbb Z^{O(d)}$. This…

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…

In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally…

Let $X$ be a Polish space with Borel probability measure $\mu,$ and let $G$ be a Borel graph on $X$ with no odd cycles and maximum degree $\Delta(G).$ We show that the Baire measurable edge chromatic number of $G$ is at most $\Delta(G)+1$,…

In this paper, we take a modest first step towards a systematic study of chromatic numbers of Cayley graphs on abelian groups. We lose little when we consider these graphs only when they are connected and of finite degree. As in the work of…

We construct, for each countable ordinal $\xi$, a closed graph with Borel chromatic number two and Baire class $\xi$ chromatic number $\aleph\_0$.

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 possible Borel chromatic numbers and edge…

Following recent result of L. M. T\' oth [arXiv:1906.03137] we show that every $2\Delta$-regular Borel graph $\mathcal{G}$ with a (not necessarily invariant) Borel probability measure admits approximate Schreier decoration. In fact, we show…