arXiv · 2611.20262
A counterexample to the subgraphings approximate the cost problem
Abstract
We prove that for every $k\ge 2$, the free group $\mathbb{F}_k$ on $k$ generators admits a finite generating set $S$ such that the Schreier graphing of the Bernoulli action of $\mathbb{F}_k$ with respect to $S$ does not admit spanning subgraphings that would approximate the cost of the action. In particular, this gives an example of a graphing that spans a treeable countable pmp equivalence relation, but does not admit a spanning subtreeing.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Balázs Bursics, Jan Grebík, Zoltán Vidnyánszky. 2026-11-15. A counterexample to the subgraphings approximate the cost problem. https://searcharxiv.com/abs/2611.20262
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.