A cut in a graph is a partition of vertices into two sets and where and . Every vertex is in exactly one set. An edge crosses the cut if and (or vice versa). The cut separates the graph into two disconnected parts.
If you physically removed all crossing edges, the graph would split into two components. Think of it as drawing a line through the graph. Edges that cross the line are cut edges. The two sides cannot communicate without crossing this boundary.