2000 character limit reached
Triangulations of uniform subquadratic growth are quasi-trees
Published 11 Jun 2021 in math.MG, math.CO, and math.PR | (2106.06443v2)
Abstract: It is known that for every $\alpha \geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $\Theta(r\alpha)$. We prove that for $\alpha <2$ every such triangulation is quasi-isometric to a tree. The result extends to Riemannian 2-manifolds of finite genus, and to large-scale-simply-connected graphs. We also prove that every planar triangulation of asymptotic dimension 1 is quasi-isometric to a tree.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.