Measurable graph combinatorics
From MaRDI portal
amenabilityasymptotic dimensionBorel equivalence relationsBorel graphdescriptive set theoryequidecompositionhyperfinitenessLovasz local lemmameasurable graph combinatoricstilings
Descriptive set theory (03E15) Flows in graphs (05C21) Measurable group actions (22F10) Length, area, volume, other geometric measure theory (28A75) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Cites work
- A complexity problem for Borel graphs
- A constructive proof of the general Lovász local lemma
- A determinacy approach to Borel combinatorics
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- A measurable-group-theoretic solution to von Neumann's problem
- Borel chromatic numbers
- Borel circle squaring
- Borel combinatorics of locally finite graphs
- Borel determinacy
- Countable abelian group actions and hyperfinite equivalence relations
- COUNTABLE BOREL EQUIVALENCE RELATIONS
- Decomposition of Sets with Small Boundary
- Equidecomposability and discrepancy; a solution of Tarski's circle-squaring problem
- Ergodic theory of amenable group actions. I: The Rohlin lemma
- Finitely additive measures on \(S^ 2\) and \(S^ 3\), invariant with respect to rotations
- For 𝑛>3 there is only one finitely additive rotationally invariant measure on the 𝑛-sphere defined on all Lebesgue measurable subsets
- Følner tilings for actions of amenable groups
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 1388189 (Why is no real title available?)
- Hyperfiniteness and Borel combinatorics
- Local spectral gap in simple Lie groups and applications
- Logic and operator algebras
- Measurable circle squaring
- Measurable dynamics
- Measurable equidecompositions for group actions with an expansion property
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Minimal definable graphs of definable chromatic number at least three
- Perfect matchings as IID factors on non-amenable groups
- Some remarks on invariant means
- Topics in orbit equivalence
- Uniformity, universality, and computability theory
This page was built for publication: Measurable graph combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6119672)