Spanning trees of locally finite graphs (Q3835472)
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 4112611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees of locally finite graphs |
scientific article; zbMATH DE number 4112611 |
Statements
1989
0 references
locally finite graphs
0 references
infinite paths
0 references
spanning tree
0 references
Spanning trees of locally finite graphs (English)
0 references
0.9029213786125184
0 references
0.8729269504547119
0 references
0.8375194668769836
0 references
0.8329324126243591
0 references
Let \(P,P_ 0,P_ 1,..\). denote one-way infinite paths in a connected locally-finite infinite graph G. Two such paths \(P_ 1\) and \(P_ 2\) are equivalent if there exists a path \(P_ 0\) such that if P is any one-way infinite subgraph of \(P_ 0\) then P has vertices in common with both \(P_ 1\) and \(P_ 2\). Classes of equivalent paths are called ends and an end E is called free if there exists a finite set R of vertices such that G-R has a connected component that contains one-way infinite paths from E but none from any other ends of G. Let E denote a free end of G. The author proves various results on the existence of a spanning tree T of G having a specified number of ends belonging to E.
0 references