Cut

graph-theory

Definition

Schnitt

Cut

In graph theory, a cut is a partition of vertices of a graphs into two disjoint subsets $U$ and $V$.

A cut that separates $u\in U,v\in V$ is defined as:

$$\mathrm{cut}(U,V)=\{xy\in E\mid x\in U\wedge y\in V\}$$