University of Cambridge > Talks.cam > Combinatorics Seminar > Tree-Decompositions of Infinite Graphs

Tree-Decompositions of Infinite Graphs

Add to your list(s) Download to your calendar using vCal

  • UserJohannes Carmesin (Cambridge)
  • ClockThursday 12 November 2015, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992.

The talk is self contained and I will not assume any special knowledge about infinite graphs.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity