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 $k$-arc-connected orientation if and only if it is $2k$-edge-connected, and conjectured that the same result should hold f…