Every group is the automorphism group of a graph with arbitrarily large genus
Group Theory
2025-08-29 v2 Combinatorics
Abstract
We prove that, to every abstract group , we can associate a sequence of graphs such that the automorphism group of is isomorphic to and the genus of is an unbounded function of .
Cite
@article{arxiv.2501.08747,
title = {Every group is the automorphism group of a graph with arbitrarily large genus},
author = {Marco Barbieri},
journal= {arXiv preprint arXiv:2501.08747},
year = {2025}
}
Comments
The result is already known, and the available proofs are shorter