Orienting Borel graphs

DOI10.1090/proc/15742OpenAlexW2998452790MaRDI QIDQ5027220

Riley Thornton

Publication date: 4 February 2022

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.01319

Mathematics Subject Classification ID

Descriptive set theory (03E15) Measurable group actions (22F10)

Related Items (4)

Factor-of-iid balanced orientation of non-amenable graphs ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms ⋮ Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022

Cites Work

• Unnamed Item
• Perfect matchings as IID factors on non-amenable groups
• Ends of graphed equivalence relations. II
• Cardinal invariants of closed graphs
• Topics in orbit equivalence
• Measurable versions of Vizing's theorem
• A complexity problem for Borel graphs
• A determinacy approach to Borel combinatorics
• KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
• Borel Orderings
• Selection theorems and treeability
• Borel oracles. An analytical approach to constant-time algorithms
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• Linear algebraic groups and countable Borel equivalence relations
• Unfriendly colorings of graphs with finite average degree

This page was built for publication: Orienting Borel graphs