2010/03/18 by Matthias Hamann, Hamann, Matthias
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Rings, Modules, and Algebras #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1003.3665
19 pages
arxiv created 2010/03/18 · openalex publication_date 2010/03/18 · arxiv updated 2010/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the stabilizer of some end acts transitively on the vertices of the graph. In both cases we show that the graphs have a tree-like structure.