Edge cut, edge cut set

Edge cut, edge cut set --- разрез.

A set [math]\displaystyle{ X }[/math] of edges of a graph [math]\displaystyle{ G }[/math] is called an edge cut if [math]\displaystyle{ G \setminus X }[/math] has more connected components than [math]\displaystyle{ G }[/math]. An edge cut of [math]\displaystyle{ G }[/math] minimal under inclusion is called a cocircuit of [math]\displaystyle{ G }[/math]. A vertex star, which is the set of edges in [math]\displaystyle{ G }[/math] incident to that vertex, is associated with each vertex in [math]\displaystyle{ G }[/math].