A determinacy approach to Borel combinatorics

DOI10.1090/jams/836zbMath1403.03088arXiv1304.3830MaRDI QIDQ2792320

Andrew S. Marks

Publication date: 9 March 2016

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

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

Mathematics Subject Classification ID

03E15: Descriptive set theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

37A15: General groups of measure-preserving transformations and dynamical systems

Related Items

Equitable colourings of Borel graphs, Orienting Borel graphs, Equivalence relations and determinacy, FORCING CONSTRUCTIONS AND COUNTABLE BOREL EQUIVALENCE RELATIONS, Minimal definable graphs of definable chromatic number at least three, Uniformity, universality, and computability theory, MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS, BROOKS’ THEOREM FOR MEASURABLE COLORINGS, Borel combinatorics fail in HYP, Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics, Definable Kőnig theorems, Distributed algorithms, the Lovász local lemma, and descriptive combinatorics, Measurable graph combinatorics, Borel fractional colorings of Schreier graphs, Borel asymptotic dimension and hyperfinite equivalence relations, Borel structurability on the 2-shift of a countable group, Measurable versions of Vizing's theorem, Measurable Hall's theorem for actions of abelian groups, Descriptive chromatic numbers of locally finite and everywhere two-ended graphs, A complexity problem for Borel graphs, Hyperfiniteness and Borel combinatorics, Measurable versions of the Lovász local lemma and measurable graph colorings, Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms, Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022, Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022, Equivariant maps to subshifts whose points have small stabilizers, KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS, Marked groups with isomorphic Cayley graphs but different Borel combinatorics, A brief introduction to amenable equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal Borel actions of countable groups
• Weak isomorphisms between Bernoulli shifts
• Perfect matchings as IID factors on non-amenable groups
• Borel structurability on the 2-shift of a countable group
• On the independence and chromatic numbers of random regular graphs
• Borel determinacy
• Borel chromatic numbers
• Topics in orbit equivalence
• Measurable chromatic and independence numbers for ergodic graphs and group actions
• Invariant random perfect matchings in Cayley graphs
• Limits of locally-globally convergent graph sequences
• Countable abelian group actions and hyperfinite equivalence relations
• On uniform relationships between combinatorial problems
• Every countably infinite group is almost Ornstein
• Borel oracles. An analytical approach to constant-time algorithms
• Closed Sets Without Measurable Matching
• COUNTABLE BOREL EQUIVALENCE RELATIONS
• The graph-theoretic approach to descriptive set theory
• Ultraproducts of measure preserving actions and graph combinatorics
• Measure-theoretic unfriendly colorings
• An antibasis result for graphs of infinite Borel chromatic number
• MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS