Abstract
The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism: a non-trivial automorphism whose cycles all have the same length. In this paper, we investigate the existence of semiregular automorphisms of edge-transitive graphs. In particular, we show that any regular edge-transitive graph of valency three or four has a semiregular automorphism.
Original language | English |
---|---|
Pages (from-to) | 961-972 |
Journal | Journal of Algebraic Combinatorics |
Volume | 40 |
Issue number | 4 |
Early online date | 28 Mar 2014 |
DOIs | |
Publication status | Published - Dec 2014 |