A short proof of Halin’s grid theorem

Article

Abstract

We give a short proof of Halin’s theorem that every thick end of a graph contains the infinite grid.

2000 Mathematics Subject Classification

05C83 05C99 

Key words and phrases

Infinite graph grid thick end Halin 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Diestel,Graph Theory. Springer-Verlag, 2000, 2nd edition. http ://www.math.uni-hamburg.de/home/diestel/books/graph.theory/download.htmlGoogle Scholar
  2. [2]
    R. Diestel andD. Kühn, Graph-theoretical versus topological ends of graphs.J. Comb. Theory B 87 (2003), 197–206.MATHCrossRefGoogle Scholar
  3. [3]
    R. Halin, Über unendliche Wege in Graphen.Math. Ann 157 (1964), 125–137.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    R. Halin, Über die Maximalzahl fremder unendlicher Wege in Graphen.Math. Nachr. 30 (1965), 63–85.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Mathematische Seminar 2004

Authors and Affiliations

  1. 1.Fachbereich Mathematik SP GDUniversität HamburgHamburgGermany

Personalised recommendations