论文标题
可访问的准传输图的两个特征
Two characterisations of accessible quasi-transitive graphs
论文作者
论文摘要
我们证明了局部有限的准传输连接图的可访问性的两个特征。首先，我们证明，当且仅当其有限订单的分离集为$ {\ rm aut}（g）$时，才能访问任何此类图$ G $。第二个表征表明，只有在有限的多个步骤之后，就树合并而言，每一个分裂过程都可以访问$ g $。
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 ${\rm Aut}(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.
