Embedding Borel graphs into grids of asymptotically optimal dimension
Anton Bernshteyn, Jing Yu

TL;DR
The paper proves that Borel graphs with finite subgraphs embeddable into a d-dimensional grid can be globally embedded into a Schreier graph of a free Borel action of a group with dimension proportional to d, improving previous bounds.
Contribution
It improves the embedding bounds for Borel graphs into Schreier graphs, reducing the dimension from a logarithmic function of growth rate to a linear function of the dimension d.
Findings
Borel graphs with finite subgraphs in a d-dimensional grid embed into Schreier graphs of dimension O(d).
This result strengthens previous bounds involving polynomial growth rates.
The embedding is Borel measurable, preserving the graph structure.
Abstract
Let be a Borel graph all of whose finite subgraphs embed into the -dimensional grid with diagonals. We show that then itself admits a Borel embedding into the Schreier graph of a free Borel action of . This strengthens an earlier result of the authors, in which is replaced by , where is the polynomial growth rate of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Computability, Logic, AI Algorithms
