A characterisation of all vertex-transitive finite graphs of connectivity < 5

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Jan Kurkofka, Tim Planken
DOI: 10.48550/arxiv.2602.09811
Cited by: 0

Abstract

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.

Fields of Study & Subjects

Advanced Graph Theory Research Finite Group Theory Research Graph theory and applications

Publication details

Journal / source
arXiv (Cornell University)
Publication date
10 February 2026
Language
EN
Document type
Preprint