Accessibility and ends of graphs

DOI10.1006/JCTB.1996.0023MaRDI QIDQ1924129zbMATH OpenOpenAlexFDO

Authors Rögnvaldur G. Möller

Publication date 14 October 1996

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1996.0023

zbMATH Keywords

automorphism groupinaccessible graphstructured treesthick endstransitive graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Review text

The author proves that a locally finite inaccessible graph with a transitive automorphism group has uncountably many thick ends. This result is used to show that a connected locally finite transitive graph is inaccessible if and only if it has uncountably many thick ends. The author uses the theory of structured trees to obtain his result.

Recommendations

• Vertex-transitive graphs and accessibility
• Ends of graphs. II
• Ends of graphs

Cited in

(12)

• On the Hadwiger number of infinite graphs
• Vertex-transitive graphs and accessibility
• Accessibility in transitive graphs
• Transitivity conditions in infinite graphs
• Analogues of Cayley graphs for topological groups
• A Stallings type theorem for quasi-transitive graphs
• scientific article; zbMATH DE number 2171034 (Why is no real title available?)
• scientific article; zbMATH DE number 923850 (Why is no real title available?)
• The classification of connected-homogeneous digraphs with more than one end
• Accessibility and hyperbolicity
• Inaccessible groups and protrees
• A full Halin grid theorem

This page was built for publication: Accessibility and ends of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924129)