Date of Original Version

12-2000

Type

Response or Comment

Abstract or Description

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.

DOI

10.1016/S0012-365X(01)00209-6

Share

COinS
 

Published In

Discrete Mathematics , 243, 1-3, 213-216.