arXiv Analytics

Sign in

arXiv:2501.08747 [math.GR]AbstractReferencesReviewsResources

Every group is the automorphism group of a graph with arbitrarily large genus

Marco Barbieri

Published 2025-01-15Version 1

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

Comments: 3 pages, comments are welcome!
Categories: math.GR, math.CO
Subjects: 05C10, 05C25
Related articles: Most relevant | Search more
arXiv:1805.09764 [math.GR] (Published 2018-05-24)
Automorphism groups of maps, hypermaps and dessins
arXiv:1803.02524 [math.GR] (Published 2018-03-07)
The automorphism group of the bipartite Kneser graph
arXiv:math/0602039 [math.GR] (Published 2006-02-02, updated 2006-10-09)
The Automorphism Group of a Finite p-Group is Almost Always a p-Group

Links

Toolbox