On the order of semiregular automorphisms of cubic vertex-transitive graphs
Abstract
We prove that, if is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of of order at least 6, or the number of vertices of is bounded above by an absolute constant.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.