Changes

In a directed graph, a '''dijoin''' is a set of edges arcs covering every directed cut. For a positive integer ''k'', a '''k-dijoin''' is a set of edges arcs containing ''k'' edges from every directed cut. A fundamental theorem about dijoins is the [[Lucchesi-Younger theorem]] on the minimum size of a dijoin.