2000 character limit reached
Arc-transitive graphs of valency twice a prime admit a semiregular automorphism (1901.00084v1)
Published 1 Jan 2019 in math.CO
Abstract: We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant Conjecture, which states that all finite vertex-transitive digraphs admit such automorphisms.