Tree-Decompositions of Infinite Graphs

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

• Johannes Carmesin (Cambridge)
• Thursday 12 November 2015, 14:30-15:30
• MR12.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.