‹
EXPLORE · LISTEN · DISCOVER

Hall Condition

Math · Network mathematicsVISUAL DISCOVERY 357 OF 1,100

Hall Condition

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

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

Hall’s condition says every subset of the left side must have at least as many neighbors for a complete left matching to exist. A complete balanced bipartite graph meets it.

Ask your learner to point to the part that supports their answer about hall condition. 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: 5Every selected left subset has all neighbors
A little wonder
HERE’S A LITTLE WONDER…

What does hall condition reveal about neighbors for all n left vertices in kₙ,ₙ?

A network carries routes, requirements or probability between its nodes. Hall’s condition says every subset of the left side must have at least as many neighbors for a complete left matching to exist.

No rush. Try an idea and see.
Try it

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