Spanning trees of countable graphs omitting sets of dominated ends
The paper considers infinite graphs. For the set of rays of such graphs an equivalence relation is declared saying that two rays \(R\) and \(R'\) are equivalent if one cannot separate an infinite part of \(R\) from an infinite part of \(R'\) by the removal of finitely many vertices of the graph. The equivalence classes of this relation are called ends. The paper discusses the properties of this concept in view of spanning trees of countable graphs.
scientific article; zbMATH DE number 1321844
scientific article