Two-ended quasi-transitive graphs
Combinatorics
2018-12-13 v1
Abstract
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 or an HNN-extension , where is a finite group and and . 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.
Cite
@article{arxiv.1812.04866,
title = {Two-ended quasi-transitive graphs},
author = {Babak Miraftab and Tim Rühmann},
journal= {arXiv preprint arXiv:1812.04866},
year = {2018}
}