English

Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers

Combinatorics 2020-11-10 v4

Abstract

Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct half-arc-transitive graphs with prescribed vertex stabilizers. Until recently, there have been only six known connected tetravalent half-arc-transitive graphs with nonabelian vertex stabilizers, and the question whether there exists a connected tetravalent half-arc-transitive graph with nonabelian vertex stabilizer of order 2s2^s for every s3s\geqslant3 has been wide open. This question is answered in the affirmative in this paper via the construction of a connected tetravalent half-arc-transitive graph with vertex stabilizer D82×C2m\mathrm{D}_8^2\times\mathrm{C}_2^m for each integer m1m\geqslant1, where D82\mathrm{D}_8^2 is the direct product of two copies of the dihedral group of order 88 and C2m\mathrm{C}_2^m is the direct product of mm copies of the cyclic group of order 22. The graphs constructed have surprisingly many significant properties in various contexts.

Keywords

Cite

@article{arxiv.1908.09361,
  title  = {Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers},
  author = {Binzhou Xia},
  journal= {arXiv preprint arXiv:1908.09361},
  year   = {2020}
}
R2 v1 2026-06-23T10:56:16.850Z