The smallest set of vertices in an undirected graph which separate two distinct vertices. That is, every path between them passes through some member of the cut.