2000 character limit reached
Arc-transitive graphs of valency twice a prime admit a semiregular automorphism
Published 1 Jan 2019 in math.CO | (1901.00084v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.