Two characterisations of accessible quasi-transitive graphs

MaRDI QIDQ6337770zbMATH OpenFDO

Authors Matthias Hamann, Babak Miraftab

Publication date 31 March 2020

Abstract: We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an $mAut(G)$-finitely generated semiring. The second characterisation says that $G$ is accessible if and only if every process of splittings in terms of tree amalgamations stops after finitely many steps.

This page was built for publication: Two characterisations of accessible quasi-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337770)