10 citations · 20 across the 26 of their papers we have counts for
46 papers
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…
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…
Characterising path-, ray- and branch spaces of order trees, and end spaces of infinite graphs
Max Pitz
We investigate path-, ray- and branch spaces of trees, certain topological spaces naturally associated with order theoretic trees, and provide topological characterisations for the…
Universal end-compactifications of locally finite graphs
Jan Ouborny, Max Pitz
We construct a locally finite connected graph whose Freudenthal compactification is universal for the class of completely regular continua, a class also known in the literature und…
End spaces and tree-decompositions
Marcel Koloschin, Thilo Krill, Max Pitz
We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main…
Maker-Breaker games on and
Nathan Bowler, Florian Gut, Attila Joó +1
We investigate Maker-Breaker games on graphs of size in which Maker's goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the gam…