We consider the Robust Network Design problem, i.e. the problem of dimensioning the capacities on the edges of a graph to serve point-to-point traffic demands subject to uncertainty. The scope of the paper is to investigate when the cut condition is sufficient to guarantee the feasibility for such problem.