2006
DOI: 10.1002/jgt.20202
|View full text |Cite
|
Sign up to set email alerts
|

Between ends and fibers

Abstract: Let be an infinite, locally finite, connected graph with distance function δ. Given a ray P in and a constant C ≥ 1, a vertex-sequence {x n } ∞ n=0 ⊆ VP is said to be regulated by C if, for all n ∈ N, x n+1 never precedes x n on P, each vertex of P appears at most C times in the sequence, and δ P (x n , x n+1 ) ≤ C. R. Halin (Math. Ann., 157, 1964, 125-137) defined two rays to be end-equivalent if they are joined by infinitely many pairwisedisjoint paths; the resulting equivalence classes are called ends. Mor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(8 citation statements)
references
References 10 publications
(34 reference statements)
0
8
0
Order By: Relevance
“…Let k; L 1. Let v be a word of length less than L 2 k 1 in G representing an element a n for some n 2 Z such that 1 .v/ does not contain the letter ak . Then,…”
Section: ;mentioning
confidence: 99%
See 3 more Smart Citations
“…Let k; L 1. Let v be a word of length less than L 2 k 1 in G representing an element a n for some n 2 Z such that 1 .v/ does not contain the letter ak . Then,…”
Section: ;mentioning
confidence: 99%
“…The word 1 .v/ does not contain a letter a1 . Therefore v D a˛for some j˛j < L. Obviously, n D˛and we are done.…”
Section: C1mentioning
confidence: 99%
See 2 more Smart Citations
“…The basic idea behind fibers is to consider points at infinity as equivalence classes of rays (infinite paths) which stay at bounded distance "up to linear reparametrization". In 2005 Bonnington, Richter and Watkins [BRW07] modified this concept by considering rays as equivalent whenever they stay at sublinear distance "up to linear reparametrization". They were able to use this concept to prove some nice results on infinite planar graphs, but the boundary, whose elements have been called "bundles", was not topologized and not considered for groups or vertex-transitive graphs.…”
Section: Introductionmentioning
confidence: 99%