Spanning trees in hyperbolic graphs

作者:Hamann Matthias*
来源:Combinatorica, 2016, 36(3): 313-332.
DOI:10.1007/s00493-015-3082-2

摘要

We construct spanning trees in locally finite hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has at least one but at most a bounded number of disjoint rays to each boundary point. As a corollary we extend a result of Gromov which says that from every hyperbolic graph with bounded degrees one can construct a tree (disjoint from the graph) with a continuous surjection from the ends of the tree onto the hyperbolic boundary such that the surjection is finite-to-one. We shall construct a tree with these properties as a subgraph of the hyperbolic graph, which in addition is also a spanning tree of that graph.

  • 出版日期2016-6