Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers
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 for every 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 for each integer , where is the direct product of two copies of the dihedral group of order and is the direct product of copies of the cyclic group of order . The graphs constructed have surprisingly many significant properties in various contexts.
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}
}