Changes
Created page with ''''Theorem (Lucchesi, Younger<ref>C. Lucchesi, D. Younger, A minimax theorem for directed graphs, J. London Math. Soc. (2) 17 (1978), 369--374. [http://reference.kfupm.edu.sa/con…'
'''Theorem (Lucchesi, Younger<ref>C. Lucchesi, D. Younger, A minimax theorem for directed graphs, J. London Math. Soc. (2) 17 (1978), 369--374.
[http://reference.kfupm.edu.sa/content/m/i/a_minimax_theorem_for_directed_graphs__713802.pdf PDF]
</ref>).''' In a digraph, the minimum size of a [dijoin] equals the maximum number of pairwise edge-disjoint directed cuts.
==References==
<references/>
[[Category:Theorems]]
[http://reference.kfupm.edu.sa/content/m/i/a_minimax_theorem_for_directed_graphs__713802.pdf PDF]
</ref>).''' In a digraph, the minimum size of a [dijoin] equals the maximum number of pairwise edge-disjoint directed cuts.
==References==
<references/>
[[Category:Theorems]]
