2000 character limit reached
On the order of semiregular automorphisms of cubic vertex-transitive graphs
Published 31 Jan 2023 in math.CO and math.GR | (2302.00034v1)
Abstract: We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute constant.
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.