BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Tree-Decompositions of Infinite Graphs - Johannes Carmesin (Cambri
 dge)
DTSTART:20151112T143000Z
DTEND:20151112T153000Z
UID:TALK60769@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We show that every connected graph has a spanning tree that di
 splays all its topological ends. This proves a 1964 conjecture of Halin in
  corrected form\, and settles a problem of Diestel from 1992.\n\nThe talk 
 is self contained and I will not assume any special knowledge about infini
 te graphs.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR