A PROOF OF THE BOUNDED GRAPH CONJECTURE

被引：14

作者：

DIESTEL, R ^{[1
]}

LEADER, I ^{[1
]}

机构：

[1] DEPT PURE MATH,CAMBRIDGE CB2 1SB,ENGLAND

来源：

INVENTIONES MATHEMATICAE | 1992年 / 108卷 / 01期

关键词：

D O I：

10.1007/BF02100602

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An infinite graph is called bounded if for every labelling of its vertices with natural numbers there exists a sequence of natural numbers which eventually exceeds the labelling along any ray in the graph. We prove an old conjecture of Halin, which characterizes the bounded graphs in terms of four forbidden topological subgraphs.

引用

页码：131 / 162

页数：32