Ends in spanning trees (Q1198517)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 89966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ends in spanning trees |
scientific article; zbMATH DE number 89966 |
Statements
Ends in spanning trees (English)
0 references
16 January 1993
0 references
The author deals with infinite graphs. R. Halin defined an end \(E\) of an infinite graph \(G\) as a set of 1-way infinite paths in \(G\) such that vertices \(P\) and \(Q\) are in \(E\) iff for any subset \(R\) of the vertice set there is a finite path in \(G-R\) joining \(P\) and \(Q\). The author proves that if \(T\) is a locally finite spanning tree of a connected infinite graph \(G\) and \(E\) is an end of \(G\), then \(T\) has at least one 1-way infinite path in \(E\).
0 references
end
0 references
infinite graph
0 references
spanning tree
0 references
0 references
0 references
0.8800536
0 references
0.8554477
0 references
0.8433454
0 references
0.8349658
0 references
0 references
0 references
