As a consequence of this fact let's consider the following problem. We are given a graph and then we identify a particular subset of nodes; the black ones in this case. And then we define a cut-set, that is the arcs which join the black nodes with the white ones, which are across the cut defined by the set. Here we have a subset of nodes, so we can use the previous result and try to describe the cut-set through some inequalities.