Skip to main content
SpringerLink
Log in

A short proof of Halin’s grid theorem

  • Published:
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Diestel,Graph Theory. Springer-Verlag, 2000, 2nd edition. http ://www.math.uni-hamburg.de/home/diestel/books/graph.theory/download.html

  2. R. Diestel andD. Kühn, Graph-theoretical versus topological ends of graphs.J. Comb. Theory B 87 (2003), 197–206.

    Article  MATH  Google Scholar 

  3. R. Halin, Über unendliche Wege in Graphen.Math. Ann 157 (1964), 125–137.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Halin, Über die Maximalzahl fremder unendlicher Wege in Graphen.Math. Nachr. 30 (1965), 63–85.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik SP GD, Universität Hamburg, Bundesstr. 55, 20146, Hamburg, Germany

    R. Dlestel

Authors
  1. R. Dlestel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Dlestel.

Additional information

O. Riemenschneider

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dlestel, R. A short proof of Halin’s grid theorem. Abh.Math.Semin.Univ.Hambg. 74, 237–242 (2004). https://doi.org/10.1007/BF02941538

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02941538

2000 Mathematics Subject Classification

Key words and phrases

Search

Navigation