This is my web page on the basics of Woodall's conjecture for directed graphs. The conjecture states that in any directed graph the number of pairwise disjoint dijoins is equal to the size of a minimum dicut.
The conjecture reduces do the following statement: if every directed cut of the graph has k or more edges then the graph has at least k pairwise disjoint dijoins.