THE COMBINATION THEOREM AND QUASICONVEXITY
2001 ◽
Vol 11
(02)
◽
pp. 185-216
◽
We show that if G is a fundamental group of a finite k-acylindrical graph of groups where every vertex group is word-hyperbolic and where every edge-monomorphism is a quasi-isometric embedding, then all the vertex groups are quasiconvex in G (the group G is word-hyperbolic by the Combination Theorem of M. Bestvina and M. Feighn). This allows one, in particular, to approximate the word metric on G by normal forms for this graph of groups.
2014 ◽
Vol 06
(01)
◽
pp. 1-25
◽
2002 ◽
Vol 12
(05)
◽
pp. 737-745
◽
2003 ◽
Vol 12
(04)
◽
pp. 463-491
◽
Keyword(s):
2016 ◽
Vol 26
(07)
◽
pp. 1283-1321
Keyword(s):
1994 ◽
Vol 04
(04)
◽
pp. 591-616
◽
1985 ◽
Vol 60
(1)
◽
pp. 31-45
◽
2019 ◽
Vol 150
(6)
◽
pp. 2937-2951
Keyword(s):