Sharply $k$-arc-transitive-digraphs: finite and infinite examples
Combinatorics
2018-10-24 v1
Abstract
A general method for constructing sharply -arc-transitive digraphs, i.e. digraphs that are -arc-transitive but not -arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinite examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth.
Keywords
Cite
@article{arxiv.1810.09954,
title = {Sharply $k$-arc-transitive-digraphs: finite and infinite examples},
author = {Rögnvaldur G. Möller and Primož Potočnik and Norbert Seifter},
journal= {arXiv preprint arXiv:1810.09954},
year = {2018}
}