Constructing infinitely many half-arc-transitive covers of tetravalent graphs
Abstract
We prove that, given a finite graph satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of . Applying this result, we establish the existence of infinite families of finite tetravalent half-arc-transitive graphs with certain vertex stabilizers, and classify the vertex stabilizers up to order 28 of finite connected tetravalent half-arc-transitive graphs. This sheds some new light on the longstanding problem of classifying the vertex stabilizers of finite tetravalent half-arc-transitive graphs.
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.