Approximate Schreier decorations and approximate Kőnig’s line coloring Theorem

@article{Grebk2022ApproximateSD,
  title={Approximate Schreier decorations and approximate Kőnig’s line coloring Theorem},
  author={Jan Greb{\'i}k},
  journal={Annales Henri Lebesgue},
  year={2022}
}
  • Jan Grebík
  • Published 5 October 2021
  • Mathematics
  • Annales Henri Lebesgue
Following recent result of L. M. Tóth [arXiv:1906.03137] we show that every 2∆-regular Borel graph G with a (not necessarily invariant) Borel probability measure admits approximate Schreier decoration. In fact, we show that both ingredients from the analogous statements for finite graphs have approximate counterparts in the measurable setting, i.e., approximate König’s line coloring Theorem for Borel graphs without odd cycles and approximate balanced orientation for even degree Borel graphs. It… 
1 Citations
Borel fractional colorings of Schreier graphs
. Let Γ be a countable group and let G be the Schreier graph of the free part of the Bernoulli shift Γ ý 2 Γ (with respect to some finite subset F Ď Γ). We show that the Borel fractional chromatic

References

SHOWING 1-10 OF 16 REFERENCES
KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by Kőnig, $d$ colors suffice if
BOREL CHROMATIC NUMBERS
We study in this paper graph coloring problems in the context of descriptive set theory. We consider graphs G=(X, R), where the vertex set X is a standard Borel space (i.e., a complete separable
Invariant Schreier decorations of unimodular random networks
  • L. T'oth
  • Mathematics
    Annales Henri Lebesgue
  • 2021
We prove that every $2d$-regular unimodular random network carries an invariant random Schreier decoration. Equivalently, it is the Schreier coset graph of an invariant random subgroup of the free
Closed sets without measurable matching
TLDR
A rectangle in the unit square is constructed such that its perimeter contains a matching but does not contain a Borel matching or a matching measurable with respect to the linear measure, and a closed set with this property is presented.
Borel oracles. An analytical approach to constant-time algorithms
TLDR
The Borel oracle machinery is a tool that can be used to convert some statements in Borel graph theory to theorems in the field of constant-time algorithms and the power of this tool is illustrated to prove the existence of the above mentioned constant- time approximation algorithm.
Large Networks and Graph Limits
The book Large Networks and Graph Limits, xiv + 475 pp., published in late 2012, comprises five parts, the first an illuminating introduction and the last a tantalizing taste of how the scope of the
Ultraproducts of measure preserving actions and graph combinatorics
Abstract Ultraproducts of measure preserving actions of countable groups are used to study the graph combinatorics associated with such actions, including chromatic, independence and matching
Parameter testing in bounded degree graphs of subexponential growth
  • G. Elek
  • Mathematics, Computer Science
    Random Struct. Algorithms
  • 2010
TLDR
This work proves that graph parameters such as the independence ratio or the edit‐distance from 3‐colorability are testable in bounded degree graphs of subexponential growth.
The measurable Hall theorem fails for treeings
We construct for every d ≥ 2 a d-regular acyclic measurably bipartite graphing that admits no measurable perfect matching. This answers a question of Kechris and Marks.
...
...