Orienting Borel graphs

DOI10.1090/PROC/15742MaRDI QIDQ5027220zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Borel chromatic numbers
• A complexity problem for Borel graphs
• A bound on measurable chromatic numbers of locally finite Borel graphs
• Measurable perfect matchings for acyclic locally countable Borel graphs
• Borel combinatorics of locally finite graphs

Cites work

• A complexity problem for Borel graphs
• A determinacy approach to Borel combinatorics
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• Borel oracles. An analytical approach to constant-time algorithms
• Borel Orderings
• Cardinal invariants of closed graphs
• Ends of graphed equivalence relations. II
• scientific article; zbMATH DE number 6116733 (Why is no real title available?)
• Kőnig's line coloring and Vizing's theorems for graphings
• Linear algebraic groups and countable Borel equivalence relations
• Measurable versions of Vizing's theorem
• Perfect matchings as IID factors on non-amenable groups
• Selection theorems and treeability
• Topics in orbit equivalence
• Unfriendly colorings of graphs with finite average degree

Cited in

(11)

• 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
• Factor-of-iid balanced orientation of non-amenable graphs
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
• Orienting Borel Graphs
• One-ended spanning trees and definable combinatorics
• Borel Vizing's theorem for graphs of subexponential growth
• ^1_1 effectivization in Borel combinatorics
• Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
• Continuous combinatorics of abelian group actions
• Borel local lemma: arbitrary random variables and limited exponential growth

This page was built for publication: Orienting Borel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027220)