English

Constructing infinitely many half-arc-transitive covers of tetravalent graphs

Combinatorics 2020-11-25 v2 Group Theory

Abstract

We prove that, given a finite graph Σ\Sigma satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of Σ\Sigma. 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 282^8 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.

Keywords

Cite

@article{arxiv.1912.10695,
  title  = {Constructing infinitely many half-arc-transitive covers of tetravalent graphs},
  author = {Pablo Spiga and Binzhou Xia},
  journal= {arXiv preprint arXiv:1912.10695},
  year   = {2020}
}

Comments

12 pages