Ends of graphs

DOI10.1017/S0305004100075344zbMath0772.05050OpenAlexW2051535646MaRDI QIDQ4004614

Rögnvaldur G. Möller

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/s0305004100075344

zbMATH Keywords

treesendsstructure tree

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Related Items

On finite fixed sets in infinite graphs, Primitivity and ends of graphs, Two-ended quasi-transitive graphs, A Stallings type theorem for quasi-transitive graphs, Group actions on metric spaces: fixed points and free subgroups, Amenable hyperbolic groups, The fundamental group of a locally finite graph with ends, Graph-theoretical versus topological ends of 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, Inaccessible groups and protrees, On vertex transitive graphs of infinite degree, Amenable actions preserving a locally finite metric, End-transitive graphs, A survey of homogeneous structures, Quasi-isometries between non-locally-finite graphs and structure trees, \(k\)-CS-transitive infinite graphs, Cycle-free partial orders and ends of graphs, Cutting up graphs revisited – a short proof of Stallings' structure theorem, Self-embeddings of trees, Fixed sets and free subgroups of groups acting on metric spaces

Cites Work

• Unnamed Item
• A note on bounded automorphisms of infinite graphs
• Boundaries of random walks on graphs and groups with infinitely many ends
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Groups of isometries of a tree and the Kunze-Stein phenomenon
• Amenable group actions on infinite graphs
• Amenability and Kunze-Stein property for groups acting on a tree
• A note on fragments of infinite graphs
• Infinite distance transitive graphs of finite valency
• Cutting up graphs
• Über die Maximalzahl fremder unendlicher Wege in Graphen