Cubic vertex-transitive graphs of girth six
Combinatorics
2025-01-06 v4
Abstract
In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth is obtained. It is proved that every such graph, with the exception of the Desargues graph on vertices, is either a skeleton of a hexagonal tiling of the torus, the skeleton of the truncation of an arc-transitive triangulation of a closed hyperbolic surface, or the truncation of a -regular graph with respect to an arc-transitive dihedral scheme. Cubic vertex-transitive graphs of girth larger than are also discussed.
Keywords
Cite
@article{arxiv.2005.01635,
title = {Cubic vertex-transitive graphs of girth six},
author = {Primož Potočnik and Janoš Vidali},
journal= {arXiv preprint arXiv:2005.01635},
year = {2025}
}
Comments
Erratum: added missing signatures (3,3,4) and (3,4,5) in Table 2