Minor exclusion in quasi-transitive graphs
Combinatorics
2021-10-26 v1
Abstract
In this note, we show that locally finite quasi-transitive graphs are quasi-isometric to trees if and only if every other locally finite quasi-transitive graph quasi-isometric to them is minor excluded. This generalizes results by Ostrovskii and Rosenthal and by Khukhro on minor exclusion for groups.
Keywords
Cite
@article{arxiv.2110.12841,
title = {Minor exclusion in quasi-transitive graphs},
author = {Matthias Hamann},
journal= {arXiv preprint arXiv:2110.12841},
year = {2021}
}
Comments
4 pages