1 paper · 1 filter
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…