Graphs with given automorphism group and large clique number
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929679607267328 |
|---|---|
| author | Haslegrave, John |
| author_facet | Haslegrave, John |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_09779 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Graphs with given automorphism group and large clique number Haslegrave, John Combinatorics 05C25 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. |
| title | Graphs with given automorphism group and large clique number |
| topic | Combinatorics 05C25 |
| url | https://arxiv.org/abs/2501.09779 |