Carnegie Mellon University
A Note on Dijoins.pdf.pdf' (47.8 kB)
Download file

A Note on Dijoins

Download (47.8 kB)
journal contribution
posted on 1977-01-01, 00:00 authored by Gerard CornuejolsGerard Cornuejols, Bertrand Guenin
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.




Usage metrics