Normal spanning trees in uncountable graphs

9 March 2016
Max Pitz

"In a paper from 2001, Diestel and Leader characterised uncountable graphs with normal spanning trees through a class of forbidden minors. In this talk we investigate under which circumstances this class of forbidden minors can be made nice. In particular, we will see that there is a nice solution to this problem under Martin’s Axiom. Also, some connections to the Stone-Chech remainder of the integers, and almost disjoint families are uncovered.”

  • Analytic Topology in Mathematics and Computer Science