ACCESSIBILITY AND ENDS OF GRAPHS

Authors
Citation
Rg. Moller, ACCESSIBILITY AND ENDS OF GRAPHS, J COMB TH B, 66(2), 1996, pp. 303-309
Citations number
8
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956 → ACNP
Volume
66
Issue
2
Year of publication
1996
Pages
303 - 309
Database
ISI
SICI code
0095-8956(1996)66:2<303:AAEOG>2.0.ZU;2-K
Abstract
We prove that a locally finite inaccessible graph with a transitive au tomorphism group always has uncountably many thick ends. Combined with a result of Thomassen and Woess this shows that a connected locally f inite transitive graph is inaccessible if and only if it has uncountab ly many thick ends. (C) 1996 Academic Press, Inc.