Related papers: Baire-class $\xi$ colorings: the first three level…

A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of $G$ is the maximum integer $\chi_b(G)$ for which $G$ has a…

We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $\lambda$ of countable confinality. Somewhat unexpectedly, the resulting theory is…

We show that for any Polish group $G$ and any countable normal subgroup $\Gamma\triangleleft G$, the coset equivalence relation $G/\Gamma$ is a hyperfinite Borel equivalence relation. In particular, the outer automorphism group of any…

Let Gn be the graph on n-dimensional Euclidean space connecting points of rational Euclidean distance. It is consistent relative to an inaccessible cardinal that ZF+DC holds and G3 has countable chromatic number, yet G4 has uncountable…

We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the…

We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the…

P. Kirchberger proved that, for a finite subset $X$ of $\mathbb{R}^{d}$ such that each point in $X$ is painted with one of two colors, if every $d+2$ or fewer points in $X$ can be separated along the colors, then all the points in $X$ can…

Jayne and Rogers proved that every function from an analytic space into a separable metric space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each $F_\sigma$ set under it is…

For a reductive group $G$ over a finite field $k$, and a smooth projective curve $X/k$, we give a motivic counting formula for the number of absolutely indecomposable $G$-bundles on $X$. We prove that the counting can be expressed via the…

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph $G$, denoted by $\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

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…

We show that every locally finite bipartite Borel graph satisfying a strengthening of Hall's condition has a Borel perfect matching on some comeager invariant Borel set. We apply this to show that if a group acting by Borel automorphisms on…

All spaces are assumed to be separable and metrizable. Consider the following properties of a space $X$. (1) $X$ is Polish. (2) For every countable crowded $Q\subseteq X$ there exists a crowded $Q'\subseteq Q$ with compact closure. (3)…

We prove that the countable product of lines contains a Borel linear subspace $L\ne\mathbb R^\omega$ that cannot be covered by countably many closed Haar-meager sets. This example is applied to studying the interplay between various classes…

We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…

The goal of this note is to present a combinatorial mechanism for counting certain objects associated to a variety X defined over a finite field. The basic example is that of counting conjugacy classes in GL_n(F_q), where X is the…

If $(X,d)$ is a Polish metric space of dimension $0$, then by Wadge's lemma, no more than two Borel subsets of $X$ can be incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space…

We show that if $(X,\mu)$ is a standard probability space, then every $\mu$-preserving $\aleph_0$-regular Borel graph on $X$ admits a $\mu$-measurable vertex $\aleph_0$-coloring in which every vertex sees every color in its neighborhood.

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…