2000 character limit reached
Arc-transitive graphs of valency 8 have a semiregular automorphism (1303.4501v1)
Published 19 Mar 2013 in math.CO
Abstract: One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.