arXiv · 2104.10654
Coarse selectors of graphs
Abstract
We consider a connected graph $\Gamma$ as a coarse space and prove that $\Gamma$ admits a 2-selector if and only if $\Gamma$ is either bounded or coarsely equivalent to $\mathbb{N}$ or $\mathbb{Z}$. We apply this result to geodesic metric spaces admitting linear orders compatible with coarse structures.
Explore related subjects
Keep this discovery
Igor Protasov. 2021-03-28. Coarse selectors of graphs. https://arxiv.org/abs/2104.10654
Cite the original work for its findings. Save a collection to share your selection of sources.