Graphs with given automorphism group and large clique number
Combinatorics
2025-01-20 v1
Abstract
Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique number.
Cite
@article{arxiv.2501.09779,
title = {Graphs with given automorphism group and large clique number},
author = {John Haslegrave},
journal= {arXiv preprint arXiv:2501.09779},
year = {2025}
}
Comments
1 page