1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Obstructions for normally spanned sets of vertices
Nicola Lorenz, Max Pitz
Halin conjectured that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. This has recently been proven by the second author. In th…
All graphs are majority 3-choosable
Jan Ouborny, Max Pitz
Every graph is majority 3-choosable. This generalises the result by Shelah-Milner that every graph has an unfriendly 3-partition, confirming a conjecture of Haslegrave from 2020.
The number of topological types of trees
Thilo Krill, Max Pitz
Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly distinct topological types of…
Constructing tree-decompositions that display all topological ends
Max Pitz
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.