Ends of graphed equivalence relations. I

DOI10.1007/S11856-009-0015-ZzbMath1166.03026OpenAlexW2076908623WikidataQ56989849 ScholiaQ56989849MaRDI QIDQ1001452

Benjamin D. Miller

Publication date: 17 February 2009

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-009-0015-z

zbMATH Keywords

Borel equivalence relationsgraphings of equivalence relationssmooth, hyperfinite, and aperiodic equivalence relations

Mathematics Subject Classification ID

Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Related Items (5)

Descriptive chromatic numbers of locally finite and everywhere two-ended graphs ⋮ Definable Kőnig theorems ⋮ A descriptive construction of trees and Stallings’ theorem ⋮ BROOKS’ THEOREM FOR MEASURABLE COLORINGS ⋮ MEASURABLE REALIZATIONS OF ABSTRACT SYSTEMS OF CONGRUENCES

Cites Work

• Unnamed Item
• Unnamed Item
• Borel chromatic numbers
• Topics in orbit equivalence
• Selection theorems and treeability
• Trees and amenable equivalence relations
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I
• Sets with doubleton sections, good sets and ergodic theory
• COUNTABLE BOREL EQUIVALENCE RELATIONS

This page was built for publication: Ends of graphed equivalence relations. I