Nicola Lorenz gave a talk on the existence of a normal tree spanning a given set of vertices in an infinite graph in terms of the coloring number of rooted minors at the Discrete Math Seminar

On April 15, 2025, Nicola Lorenz from the University of Hamburg gave a talk on the existence of a normal tree spanning a given set of vertices in an infinite graph in terms of the coloring number of rooted minors at the Discrete Math Seminar. The title of her talk was “A Minor Characterisation of Normally Spanned Sets of Vertices“.