1 citations · 1 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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.CO2023
Towards Nash-Williams Orientation Conjecture for Infinite Graphs
Amena Assem
In 1960 Nash-Williams proved that an edge-connectivity of 2k is sufficient for a finite graph to have a k-arc-connected orientation. He then conjectured that the same is true for i…