Abstract
This paper builds on work characterising digraphs with rich transitivity properties. When such digraphs are equipped with a rank function onto a colexicographic power of ℤ they arise as direct limits of better understood structures. These structures, it will be seen, contain sufficient information to describe the cycles of the full structure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cameron, P., Praeger C., Wormald, N.: Infinite highly arc transitive digraphs and universal covering digraphs. Combinatorica 13(4), 377–396 (1993)
Gray, R., Truss, J.: Countable locally 2-arc-transitive bipartite graphs. http://www1.maths.leeds.ac.uk/pure/staff/truss/bob3final2.pdf (2013). Accessed 18 May 2013
Maclane, S.: Categories for the Working Mathematician, 2nd edn. Springer (1998)
Warren, R.: The structure of k-CS-transitive cycle-free partial orders. Mem. Am. Math. Soc. 129(614) (1997)
Morel, A.: A class of relation types isomorphic to the ordinals. Michigan Math. J. 12, 203–215 (1965)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, C. Ranked Highly-Arc-Transitive Digraphs as Colimits. Order 31, 143–158 (2014). https://doi.org/10.1007/s11083-013-9294-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-013-9294-4