Borel fractional colorings of Schreier graphs

DOI10.5802/ahl.145arXiv2105.11557OpenAlexW3164867379MaRDI QIDQ6159728

Anton Bernshteyn

Publication date: 20 June 2023

Published in: Annales Henri Lebesgue (Search for Journal in Brave)

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

zbMATH Keywords

symbolic dynamicsBorel setsgroup actionfractional coloringSchreier graphBorel combinatorics

Mathematics Subject Classification ID

Descriptive set theory (03E15) Coloring of graphs and hypergraphs (05C15) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Borel structurability on the 2-shift of a countable group
• Borel chromatic numbers
• Local algorithms for independent sets are half-optimal
• Invariant Schreier decorations of unimodular random networks
• Approximate Schreier decorations and approximate Kőnig's line coloring theorem
• Measurable versions of the Lovász local lemma and measurable graph colorings
• Large independent sets in regular graphs of large girth
• A determinacy approach to Borel combinatorics
• Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
• Bernoulli actions are weakly contained in any free action
• Ultraproducts of measure preserving actions and graph combinatorics
• Borel Combinatorics of Locally Finite Graphs

This page was built for publication: Borel fractional colorings of Schreier graphs