‹
EXPLORE · LISTEN · DISCOVER

Matching

Math · Network mathematicsVISUAL DISCOVERY 356 OF 1,100

Matching

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

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

A matching uses edges that share no vertices. On an n-vertex path, its largest size is floor(n/2).

Ask your learner to point to the part that supports their answer about matching. 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: 512345
A little wonder
HERE’S A LITTLE WONDER…

What does matching reveal about maximum matching in path?

A network carries routes, requirements or probability between its nodes. A matching uses edges that share no vertices.

No rush. Try an idea and see.
Try it

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