Minimal Edge Cut

Download Wolfram Notebook

A minimal edge cut is an edge cut of a graph that is not a proper subset of any other edge cut.

Every minimum edge cut is a minimal edge cut, but the converse does not necessarily hold.

See also

Edge Cut, Minimal Set, Minimum Edge Cut

Explore with Wolfram|Alpha

More things to try:

Cite this as:

Weisstein, Eric W. "Minimal Edge Cut." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimalEdgeCut.html

Subject classifications