Highly arc-transitive digraphs — Structure and counterexamples

@article{DeVos2015HighlyAD,
  title={Highly arc-transitive digraphs — Structure and counterexamples},
  author={Matt DeVos and Bojan Mohar and Robert S{\'a}mal},
  journal={Combinatorica},
  year={2015},
  volume={35},
  pages={553-571}
}
Two problems of Cameron, Praeger, and Wormald [Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica (1993)] are resolved. First, locally finite highly arc-transitive digraphs with universal reachability relation are presented. Second, constructions of two-ended highly arc-transitive digraphs are provided, where each ‘building block’ is a finite bipartite digraph that is not a disjoint union of complete bipartite digraphs. Both of these were conjectured… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Infinite arc-transitive and highly-arc-transitive digraphs

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Infinite arc-transitive and highly-arc-transitive digraphs

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Descendants in highly arc transitive digraphs

  • Discrete Mathematics
  • 2002
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Praeger , On homomorphic images of edge transitive directed graphs , Australas

E Cheryl
  • Dicr . Math .
  • 2013

Graph Theory

  • Graduate Texts in Mathematics
  • 2008
VIEW 1 EXCERPT

Graph theory, third ed

Reinhard Diestel
  • Graduate Texts in Mathematics,
  • 2005
VIEW 2 EXCERPTS

Möller , Structure theory of totally disconnected locally compact groups via graphs and permutations

G Rögnvaldur
  • Möller , Descendants in highly arc transitive digraphs , Discrete Mathematics
  • 2002