A Note on Dijoins
Gerard Cornuejols
Bertrand Guenin
10.1184/R1/6703139.v1
https://kilthub.cmu.edu/articles/journal_contribution/A_Note_on_Dijoins/6703139
For every nonnegative integer arc weight function w, the minimum weight of a dicut is at least as large as the maximum number of dijoins such that no arc a is contained in more than w(a) of these dijoins. We give two examples of digraphs with strict inequality for some weight w and discuss the possibility that, together with an example due to Schrijver, these are the only “minimal” such examples.
1977-01-01 00:00:00
Dicut; Dijoin; Min–max theorem; Woodall's conjecture