A characterisation of all vertex-transitive finite graphs of connectivity < 5
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911437894451200 |
|---|---|
| author | Kurkofka, Jan Planken, Tim |
| author_facet | Kurkofka, Jan Planken, Tim |
| contents | We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_09811 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A characterisation of all vertex-transitive finite graphs of connectivity < 5 Kurkofka, Jan Planken, Tim Combinatorics Group Theory 05C40 (Primary) 05C75, 05C83, 05E18 (Secondary) We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions. |
| title | A characterisation of all vertex-transitive finite graphs of connectivity < 5 |
| topic | Combinatorics Group Theory 05C40 (Primary) 05C75, 05C83, 05E18 (Secondary) |
| url | https://arxiv.org/abs/2602.09811 |