3 papers
math.CO2023
The Nash-Williams orientation theorem for graphs with countably many ends
Amena Assem, Marcel Koloschin, Max Pitz
Nash-Williams proved in 1960 that a finite graph admits a -arc-connected orientation if and only if it is -edge-connected, and conjectured that the same result should hold f…
math.CO2022
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…
math.CO2020
Orientations of infinite graphs
Marcel Koloschin, Max Pitz
Building on recent work by Thomassen, we show that Nash-Williams' orientation theorem, that every finite -edge-connected multigraph has a -arc-connected orientation, also ho…