Coarse selectors of graphs

DOI10.1007/S10958-024-06990-9MaRDI QIDQ6152070zbMATH OpenOpenAlexFDO

Authors Igor V. Protasov

Publication date 11 March 2024

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

2-selector of a graphcoarse structurelinear order compatible with coarse structure

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Geometric group theory (20F65) Selections in general topology (54C65)

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 $mathbbN$ or $mathbbZ$. We apply this result to geodesic metric spaces admitting linear orders compatible with coarse structures.

Recommendations

• Selectors of discrete coarse spaces
• Selectors and orderings of coarse spaces
• Coarse selectors of groups
• Linearly ordered coarse spaces
• Ray-like graphs.

Cites work

• Coarse selectors of groups
• scientific article; zbMATH DE number 5286349 (Why is no real title available?)
• scientific article; zbMATH DE number 1301927 (Why is no real title available?)
• scientific article; zbMATH DE number 2012373 (Why is no real title available?)
• scientific article; zbMATH DE number 1544074 (Why is no real title available?)
• scientific article; zbMATH DE number 3213310 (Why is no real title available?)
• Selectors and orderings of coarse spaces
• Selectors of discrete coarse spaces

Cited in

(2)

• Selectors of discrete coarse spaces
• Coarse selectors of groups

This page was built for publication: Coarse selectors of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152070)