Infinite primitive and distance transitive directed graphs of finite out-valency

Daniela Amato, David M. Evans

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
5 Downloads (Pure)


We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In particular, we show that there are only countably many possibilities for the isomorphism type of such a descendant set, thereby confirming a conjecture of the first Author. As a partial converse, we show that certain related conditions on a countable digraph are sufficient for it to occur as the descendant set of a primitive, distance transitive digraph.
Original languageEnglish
Pages (from-to)33-50
Number of pages18
JournalJournal of Combinatorial Theory, Series B
Early online date31 Mar 2015
Publication statusPublished - Sep 2015


  • Infinite digraphs
  • Distance transitivity
  • High arc transitivity
  • Primitive groups

Cite this