Pages that link to "Item:Q2792320"
From MaRDI portal
The following pages link to A determinacy approach to Borel combinatorics (Q2792320):
Displayed 27 items.
- Borel structurability on the 2-shift of a countable group (Q888546) (← links)
- Measurable versions of Vizing's theorem (Q2006081) (← links)
- Measurable Hall's theorem for actions of abelian groups (Q2135440) (← links)
- Descriptive chromatic numbers of locally finite and everywhere two-ended graphs (Q2141707) (← links)
- A complexity problem for Borel graphs (Q2238048) (← links)
- Hyperfiniteness and Borel combinatorics (Q2302850) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
- Groups and dynamics: topology, measure, and Borel structure. Abstracts from the workshop held January 16--22, 2022 (Q2693030) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- Equivariant maps to subshifts whose points have small stabilizers (Q2699496) (← links)
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
- Marked groups with isomorphic Cayley graphs but different Borel combinatorics (Q3298796) (← links)
- A brief introduction to amenable equivalence relations (Q3299564) (← links)
- Equitable colourings of Borel graphs (Q5014071) (← links)
- Orienting Borel graphs (Q5027220) (← links)
- Equivalence relations and determinacy (Q5081953) (← links)
- FORCING CONSTRUCTIONS AND COUNTABLE BOREL EQUIVALENCE RELATIONS (Q5100040) (← links)
- Minimal definable graphs of definable chromatic number at least three (Q5149654) (← links)
- Uniformity, universality, and computability theory (Q5268400) (← links)
- MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS (Q5738201) (← links)
- BROOKS’ THEOREM FOR MEASURABLE COLORINGS (Q5739905) (← links)
- Borel combinatorics fail in <i>HYP</i> (Q6038479) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
- Definable Kőnig theorems (Q6095830) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Borel fractional colorings of Schreier graphs (Q6159728) (← links)