期刊论文详细信息
| Electronic Journal Of Combinatorics | |
| A Simple Existence Criterion for Normal Spanning Trees | |
| Reinhard Diestel1 | |
| 关键词: Infinite graph; Normal spanning tree; | |
| DOI : | |
| 学科分类：离散数学和组合数学 | |
| 来源: Electronic Journal Of Combinatorics | |
 PDF
|
|
【 摘 要 】
Halin proved in 1978 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 man
【 授权许可】
Others
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201909029558809ZK.pdf | 220KB |  download |
878987797
028-85220240
