论文标题
哈林正常跨越树的证明
Proof of Halin's normal spanning tree conjecture
论文作者
论文摘要
哈林（Halin）猜想20年前，当且仅当它的每个少数都具有可计数的着色号码时，图形就有正常的生成树。我们证明了哈林的猜想。这意味着对于具有正常生成树的属性，禁止的次要表征。
Halin conjectured 20 years ago that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. We prove Halin's conjecture. This implies a forbidden minor characterisation for the property of having a normal spanning tree.
