Accessibility and ends of graphs (Q1924129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 934796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accessibility and ends of graphs |
scientific article; zbMATH DE number 934796 |
Statements
Accessibility and ends of graphs (English)
0 references
14 October 1996
0 references
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.
0 references
inaccessible graph
0 references
automorphism group
0 references
thick ends
0 references
transitive graph
0 references
structured trees
0 references
0.847140371799469
0 references
0.8394860029220581
0 references
