A short proof of Halin’s grid theorem

Article

DOI: 10.1007/BF02941538

Cite this article as:
Dlestel, R. Abh.Math.Semin.Univ.Hambg. (2004) 74: 237. doi:10.1007/BF02941538
  • 41 Downloads

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

05C8305C99

Key words and phrases

Infinite graphgridthick endHalin

Copyright information

© Mathematische Seminar 2004

Authors and Affiliations

  1. 1.Fachbereich Mathematik SP GDUniversität HamburgHamburgGermany