Advertisement

Inventiones mathematicae

, Volume 108, Issue 1, pp 131–162 | Cite as

A proof of the bounded graph conjecture

  • Reinhard Diestel
  • Imre Leader
Article

Summary

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.

Keywords

Natural Number Infinite Graph Bounded Graph Topological Subgraph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Diestel, R.: Graph Decompositions-a study in infinite graph theory. Oxford: Oxford University Press 1990Google Scholar
  2. 2.
    Diestel, R.: On spanning trees andk-connectedness in infinite graphs J. Comb. Theory, Ser. B (to appear)Google Scholar
  3. 3.
    Halin, R.: Simplicial decompositions of infinite graphs. In: Bollobás, B. (ed.) Advances in Graph Theory (Ann. Discrete Math., vol. 3) Amsterdam London: North-Holland 1978Google Scholar
  4. 4.
    Halin, R.: Some problems and results in infinite graphs In: Andersen L.D. et al. (eds.) Graph Theory in Memory of G.A. Dirac. (Ann. Discrete Math., vol. 41) Amsterdam London: North-Holland 1989Google Scholar
  5. 5.
    Halin, R.: Bounded graphs. In: Diestel, R. (ed.) Directions in infinite graph theory and combinatorics Discrete Math.95 (1991)Google Scholar
  6. 6.
    Jung, H.A.: Wurzelbäume und unendliche Wege in Graphen. Math. Nachr.41, 1–22 (1969)Google Scholar
  7. 7.
    König, D.: Theorie der endlichen und unendlichen Graphen. Leipzig: 1936 Akademische Verlagsgesellschaft; reprinted: New York: Chelsea 1950Google Scholar
  8. 8.
    Prömel, H.J., Voigt, B.: Aspects of Ramsey Theory. Berlin Heidelberg New York: Springer (in preparation)Google Scholar
  9. 9.
    Rado, R.: Universal graphs and universal functions. Acta Arith.,9, 331–340 (1964)Google Scholar

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Reinhard Diestel
    • 1
  • Imre Leader
    • 2
  1. 1.Faculty of Mathematics, (SFB343)Bielefeld UniversityBielefeldGermany
  2. 2.Department of Pure MathematicsCambridgeEngland

Personalised recommendations