科研之友
微信
新浪微博
Facebook
分享链接
摘要
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-N0, one in which every edge has been replaced by uncountably many parallel edges; and (ii) G has no K-N0 subgraph. We show that the second condition is unnecessary.
- 出版日期2016-5-13
