Ends of graphs. II
From MaRDI portal
Publication:4008584
DOI10.1017/S0305004100075551zbMath0755.05077OpenAlexW2068946620MaRDI QIDQ4008584
Publication date: 27 September 1992
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004100075551
Related Items (21)
Boundary and entropy of space homogeneous Markov chains ⋮ CAYLEY–ABELS GRAPHS AND INVARIANTS OF TOTALLY DISCONNECTED, LOCALLY COMPACT GROUPS ⋮ Primitivity and ends of graphs ⋮ Bilateral denseness of the hyperbolic limit points of groups acting on metric spaces ⋮ Vertex Cuts ⋮ A Stallings type theorem for quasi-transitive graphs ⋮ Group actions on metric spaces: fixed points and free subgroups ⋮ Boundaries of dense subgroups of totally disconnected groups ⋮ The fundamental group of a locally finite graph with ends ⋮ On fixing boundary points of transitive hyperbolic graphs ⋮ The homology of a locally finite graph with ends ⋮ A descriptive construction of trees and Stallings’ theorem ⋮ Analogues of Cayley graphs for topological groups ⋮ Groups acting on semimetric spaces and quasi-isometries of monoids ⋮ Amenable actions preserving a locally finite metric ⋮ End-transitive graphs ⋮ Orbital digraphs of infinite primitive permutation groups ⋮ Quasi-isometries between non-locally-finite graphs and structure trees ⋮ Rational discrete first degree cohomology for totally disconnected locally compact groups ⋮ Cycle-free partial orders and ends of graphs ⋮ Cutting up graphs revisited – a short proof of Stallings' structure theorem
Cites Work
- Boundaries of random walks on graphs and groups with infinitely many ends
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- Infinite paths that contain only shortest paths
- Amenable group actions on infinite graphs
- A note on fragments of infinite graphs
- Topological groups and infinite graphs
- Harmonic functions and ends of graphs
This page was built for publication: Ends of graphs. II