Two-ended quasi-transitive graphs

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS(2022)

引用 0|浏览0
暂无评分
摘要
The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation A *(C) B or an HNN-extension *C-phi, where C is a finite group and [A: C] = [B: C] = 2 and phi is an element of Aut(C). In this paper, we show that there is a way in order to spilt two-ended quasi-transitive graphs without dominated ends and two-ended transitive graphs over finite subgraphs in the above sense. As an application of it, we characterize all groups acting with finitely many orbits almost freely on those graphs.
更多
查看译文
关键词
Two-ended graphs, quasi-transitive graphs, tree-decompositions, tree-amalgamations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要