2 papers
math.CO2024
The strong Nash-Williams orientation theorem for rayless graphs
Max Pitz, Jacob Stegemann
In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least h…
math.CO2024
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…