Spanning trees of countable graphs omitting sets of dominated ends (Q1297479)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spanning trees of countable graphs omitting sets of dominated ends |
scientific article; zbMATH DE number 1321844
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees of countable graphs omitting sets of dominated ends |
scientific article; zbMATH DE number 1321844 |
Statements
Spanning trees of countable graphs omitting sets of dominated ends (English)
0 references
9 August 1999
0 references
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.
0 references
infinite graphs
0 references
ends
0 references
spanning trees
0 references
