Probability and Random processes.

Let G = (V. E) be a finite graph. For any set W of vertices and any edge e E, define the indicator function 1 if e connects W and We Iw (e) = 0 otherwise Set Nw LeEE Iw(e). Show that there exists W CV such that Nw 2E =