2000 character limit reached
Asymptotic dimension of multi-ended quasi-transitive graphs
Published 5 Dec 2019 in math.CO | (1912.02683v1)
Abstract: We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of Tselekidis for HNN-extensions of groups to tree amalgamations of graphs. As a corollary, we obtain an upper bound on the asymptotic dimension of a multi-ended quasi-transitive locally finite graph based on any of their factorisations.
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.