####

#### A proof of the bounded graph conjecture

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.

Download: DVI; PDF