End-transitive graphs
From MaRDI portal
Publication:1760367
Abstract: 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.
Recommendations
Cites work
- A structure theorem for boundary-transitive graphs with infinitely many ends
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- End compactifications in non-locally-finite graphs
- Ends of graphs
- Ends of graphs. II
- Metric ends, fibers and automorphisms of graphs
- On translations of double rays in graphs
- Quasi-isometries between non-locally-finite graphs and structure trees
- Topological groups and infinite graphs
Cited in
(15)- Transitive digraphs with more than one end
- Ends of graphs. II
- Group actions on metric spaces: fixed points and free subgroups
- Flows, currents, and cycles for Markov chains: large deviation asymptotics
- Ends of graphs
- On fixing boundary points of transitive hyperbolic graphs
- Vertex cuts
- On vertex transitive graphs of infinite degree
- On tree-decompositions of one-ended graphs
- The classification of connected-homogeneous digraphs with more than one end
- On the fixed ends of hyperbolic translations of infinite graphs
- A Stallings type theorem for quasi-transitive graphs
- Big subsets with small boundaries in a graph with a vertex-transitive group of automorphisms
- A note on the growth of transitive graphs
- Locally finite, planar, edge-transitive graphs
This page was built for publication: End-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760367)