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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Tree-Decompositions of Infinite Graphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Average on Saturdays: 7635.33898305 kWh Institute of Metabolic Science (IMS), Level 4 ATC, Seminar rooms 1,2 & 3

Other talks

Decoding genomic chaos - a pancancer compendium of chromosomal instability The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Group Work A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Title TBC Filial Lines: Art Spiegelman, Alison Bechdel, and Comics Form
 

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