Tetravalent arc-transitive graphs with unbounded vertex-stabilisers
Combinatorics
2010-10-14 v1
Abstract
It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of exceptional graphs, related to the lexicographic product of a cycle with an edgeless graph on two vertices, only a few such infinite families of graphs are known. In this paper, we present two more families of tetravalent arc-transitive graphs with large vertex-stabilisers, each significant for its own reason.
Keywords
Cite
@article{arxiv.1010.2549,
title = {Tetravalent arc-transitive graphs with unbounded vertex-stabilisers},
author = {Primoz Potocnik and Pablo Spiga and Gabriel Verret},
journal= {arXiv preprint arXiv:1010.2549},
year = {2010}
}
Comments
9 pages