‹
EXPLORE · LISTEN · DISCOVER

Minimum Cut

Math · Network mathematicsVISUAL DISCOVERY 355 OF 1,100

Minimum Cut

Explorer · about 8 minutes · a little curiosity goes a long way

Lesson details
Browse all adventures
For grown-ups
Today’s little discovery

A minimum cut removes the least total edge capacity needed to separate a graph. In a unit-capacity complete graph, isolating one vertex cuts n−1 edges.

Ask your learner to point to the part that supports their answer about minimum cut. For graphs, matrices or probabilities with an adult, explain unfamiliar ideas together before using the model.

This is a learning model. Try the take-home activity together.
Voice settings

Using Heart (en-US).

Saved voices download ahead of play for this activity. No lesson text is sent to a speech service.The sample plays once and does not change the Sound on/off setting.
Your adventure steps
  1. Wonder
  2. Guess
  3. Try it
  4. Discover
  5. Celebrate
01 / 05
Vertices: 5Cut every edge leaving one vertex
A little wonder
HERE’S A LITTLE WONDER…

What does minimum cut reveal about minimum cut of complete graph?

A network carries routes, requirements or probability between its nodes. A minimum cut removes the least total edge capacity needed to separate a graph.

No rush. Try an idea and see.
Try it

Open Lesson to read the question, choose your idea, and continue.