We analyze the technique used by Adams and Kechris (2000) to obtain their results about Borel reducibility of countable Borel equivalence relations. Using this technique, we show that every Σ1 equivalence relation is Borel reducible to the Borel bi-reducibility of countable Borel equivalence relations. We also apply the technique to two other classes of essentially uncountable Borel equivalence...

We investigate the class of bipartite Borel graphs organized by the order of Borel homomorphism. We show that this class is unbounded by finding a jump operator for Borel graphs analogous to a jump operator of Louveau for Borel equivalence relations. The proof relies on a non-separation result for iterated Fréchet ideals and filters due to Debs and Saint Raymond. We give a new proof of this fac...

An equivalence relation E on a standard Borel space is hyperfinite if E is the increasing union of countably many Borel equivalence relations En where all En-equivalence classs are finite. In this article we establish the following theorem: if a countable abelian group acts on a standard Borel space in a Borel manner then the orbit equivalence relation is hyperfinite. The proof uses constructio...

A topological space is a Borel space if it is homeomorphic to a Borel subset of a Polish space (Bertsekas and Shreve, 1978, Definition 7.7). Examples of Borel spaces include any Borel subset of a Euclidean space Rd and, more generally, any Borel subset of a Polish space (Bertsekas and Shreve, 1978, Proposition 7.12). If X and Y are Borel spaces, a function g : X × Y → R is upper semianalytic if...

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 chromatic numbers of bounded degree acyclic hyperfinite Borel graphs and use this to answer a question of Kechris and Marks about the relationship between Borel c...

We prove that for every Borel equivalence relation E, either E is Borel reducible to E0, or the family of Borel equivalence relations incompatible with E has cofinal essential complexity. It follows that if F is a Borel equivalence relation and F is a family of Borel equivalence relations of non-cofinal essential complexity which together satisfy the dichotomy that for every Borel equivalence r...

Given a countable Borel equivalence relation E on a Polish space, let IE denote the σ-ideal generated by the Borel partial transversals of E. We show that there is a Borel homomorphism from IE to IF if and only if there is a smooth-to-one Borel homomorphism from a finite index Borel subequivalence relation of E to F . As a corollary, we see that IE is homogeneous in the sense of Zapletal (2007,...

Families of Borel equivalence relations and quasiorders that are cofinal with respect to the Borel reducibility ordering, ≤B , are constructed. There is an analytic ideal on ù generating a complete analytic equivalence relation and any Borel equivalence relation reduces to one generated by a Borel ideal. Several Borel equivalence relations, among them Lipschitz isomorphism of compact metric spa...

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of Borel reducibility. Following the approach of Louveau and Rosendal in [8] for the study of analytic equivalence relations, we study countable Bo...