A Note on Dijoins
journal contributionposted on 01.01.1977 by Gerard Cornuejols, Bertrand Guenin
Any type of content formally published in an academic journal, usually following a peer-review process.
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.