Infinite arc-transitive and highly-arc-transitive digraphs
Combinatorics
2018-11-28 v2
Abstract
A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, local quasi-primitivity and prime out-valency, imply that an arc-transitive digraph must be highly-arc-transitive. These are then applied to give a complete classification of two-ended highly-arc-transitive digraphs with prime in- and out-valencies.
Cite
@article{arxiv.1811.02995,
title = {Infinite arc-transitive and highly-arc-transitive digraphs},
author = {Rögnvaldur G. Möller and Primož Potočnik and Norbert Seifter},
journal= {arXiv preprint arXiv:1811.02995},
year = {2018}
}
Comments
To appear in European Journal of Combinatorics. Statements of Corollaries 14, 16 and 17 corrected