论文标题
快速证明戴斯特的正常跨越树标准
Quickly proving Diestel's normal spanning tree criterion
论文作者
论文摘要
我们为Diestel标准提供了两个简短的证据，即连接的图具有正常的生成树，只要它包含一个可数的集团的细分，在该集团中，每个边缘都被无数的平行边缘所取代。
We present two short proofs for Diestel's criterion that a connected graph has a normal spanning tree provided it contains no subdivision of a countable clique in which every edge has been replaced by uncountably many parallel edges.
