Measurable graph combinatorics
From MaRDI portal
Publication:6119672
DOI10.4171/icm2022/157MaRDI QIDQ6119672
Publication date: 24 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
tilingsamenabilityBorel equivalence relationsdescriptive set theoryhyperfinitenessasymptotic dimensionLovasz local lemmaBorel graphequidecompositionmeasurable graph combinatorics
Descriptive set theory (03E15) Length, area, volume, other geometric measure theory (28A75) Dissections and valuations (Hilbert's third problem, etc.) (52B45) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20) Measurable group actions (22F10) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Measurable circle squaring
- Perfect matchings as IID factors on non-amenable groups
- A measurable-group-theoretic solution to von Neumann's problem
- Finitely additive measures on \(S^ 2\) and \(S^ 3\), invariant with respect to rotations
- Some remarks on invariant means
- Borel determinacy
- Borel chromatic numbers
- Følner tilings for actions of amenable groups
- Topics in orbit equivalence
- Measurable equidecompositions for group actions with an expansion property
- A complexity problem for Borel graphs
- Hyperfiniteness and Borel combinatorics
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Local spectral gap in simple Lie groups and applications
- Borel circle squaring
- Countable abelian group actions and hyperfinite equivalence relations
- A determinacy approach to Borel combinatorics
- A constructive proof of the general lovász local lemma
- Measurable dynamics
- Ergodic theory of amenable group actions. I: The Rohlin lemma
- For 𝑛>3 there is only one finitely additive rotationally invariant measure on the 𝑛-sphere defined on all Lebesgue measurable subsets
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- Decomposition of Sets with Small Boundary
- COUNTABLE BOREL EQUIVALENCE RELATIONS
- Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem
- Borel Combinatorics of Locally Finite Graphs
- Minimal definable graphs of definable chromatic number at least three
- Uniformity, universality, and computability theory
- Logic and operator algebras
