A simple existence criterion for normal spanning trees (Q286119)
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 6583070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple existence criterion for normal spanning trees |
scientific article; zbMATH DE number 6583070 |
Statements
A simple existence criterion for normal spanning trees (English)
0 references
20 May 2016
0 references
Summary: \textit{R. Halin} proved in 1978 [Ann. Discrete Math. 3, 93--109 (1978; Zbl 0383.05034)] that there exists a normal spanning tree in every connected graph \(G\) that satisfies the following two conditions: (i) \(G\) contains no subdivision of a `fat' \(K_{\aleph_{0}}\), one in which every edge has been replaced by uncountably many parallel edges; and (ii) \(G\) has no \(K_{\aleph_{0}}\) subgraph. We show that the second condition is unnecessary.
0 references
infinite graph
0 references
normal spanning tree
0 references
0.903386890888214
0 references
0.8733543157577515
0 references
0.8552608489990234
0 references
0.8552608489990234
0 references
0.8439486622810364
0 references
