Graphs with given automorphism group and large clique number

2025/01/16 by Haslegrave, John
#05C25 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2501.09779

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.

Related

• Every group is the automorphism group of a graph with arbitrarily large genus
• An elementary proof of a conjecture on graph-automorphism
• On a theorem of Halin
• The full automorphism group of the power (di)graph of a finite group
• Towards the Automorphism Conjecture I: Combinatorial Control