COSMO · STUDY + TEACHING DECK

Networks

February 8, 2026

A question worth sharing

Matchings

Pair vertices without reuse and use neighborhood conditions to test whether everyone can be matched.

ThinkCompareExplain

Today’s route

A question becomes an explanation.

Try

Enter through a problem. A partial attempt counts.

Connect

Use matching, perfect matching, augmenting path to name what you notice.

Convince

Build an argument a partner can check.

The goal is a method someone else can use.

The opener

Start with a question.

Opening problem

Can a graph with an odd number of vertices have a perfect matching?

Think · 2 min

Sketch, test a small case, or make a first guess.

Pair · 3 min

Compare methods. Find one thing you agree on and one question.

Be ready to share your route, even if it is unfinished.

Compare before checking

Put two attempts in conversation.

Explain

Tell a partner how you started. Let them finish before responding.

Question

Which step feels certain? Which step still needs evidence?

Build

Combine one useful idea from each attempt into a new route.

Can you explain your partner’s method in your own words?

Board conversation

Notice before naming.

Look for structure

Try a small case and record every step.
Separate what changes from what stays fixed.
State the pattern in a sentence before naming the theorem.

Make a conjecture

We think ___ because ___. A case that might break this is ___.

What changed? What stayed the same?

Useful language

Now the language has a job.

matching

edges sharing no endpoints

perfect matching

matching covering every vertex

augmenting path

alternating path that increases a matching

Use one of these words to explain something you already noticed.

The core idea

Keep the idea. Explain the conditions.

|N(S)|\ge|S|\qquad\text{for every }S\subseteq L

The idea

Pair vertices without reuse and use neighborhood conditions to test whether everyone can be matched.

What to remember

Alternating paths turn a local reassignment into a globally larger pairing.

What information does this method keep?

Worked example

One route, one decision at a time

The problem

Improve a matching using an augmenting path of length three.

Predict each next step

Start and end at unmatched vertices.
Alternate unused, used, unused edges.
Flip the status of every edge on the path.
The matching gains one edge.

Which step needs a reason, not just a calculation?

See the structure

The structure behind matchings

|N(S)|\ge|S|\qquad\text{for every }S\subseteq L

Hall's condition characterizes when a finite bipartite graph has a matching covering its left side.

Read the representation

Pair vertices without reuse and use neighborhood conditions to test whether everyone can be matched.

Look together

Point to the part that explains the relationship. Change one input and predict what changes.

What can you see here that was harder to see in words?

Two approaches

Compare the reasoning.

Structural method

Name the objects and conditions.
Use a reusable relationship.
Explain why the method must work.

Brute force

May help with a small test case.
Can hide the general reason.
Becomes unreliable when the scale grows.

Which route can you justify? What would you test first?

Reasoning clinic

Find the step that needs repair.

Investigate these concerns

May help with a small test case.
Can hide the general reason.
Becomes unreliable when the scale grows.

Repair together

Name the missing condition. Try a small counterexample. Rewrite one step so it is justified.

A useful correction explains why the original step fails.

Work together

Investigate matchings

Your shared task

Groups solve assignment cards, then draw the alternating paths used to repair conflicts.

Explore

4 min - test cases

Compare

5 min - form a rule

Defend

4 min - defend the rule

Everyone should be able to explain the group’s final claim.

Share → connect

What did the room discover?

Bring your evidence

Share a conjecture, a useful example, or a route that changed.

Connections to investigate

Alternating paths turn a local reassignment into a globally larger pairing.
A complete solution names the condition that makes the method valid.
A counterexample is useful when it exposes a missing condition.

Which observation explains the mechanism?

Try → explain → check

Your turn to build the route

The problem

Students A,B,C may choose projects from lists A:{1,2}, B:{1}, C:{2,3}. Can they receive distinct projects?

Predict each next step

Build a bipartite graph using the allowed lists.
B must receive project 1.
Then give A project 2 and C project 3.
The matching A-2, B-1, C-3 covers all three students.

Which step needs a reason, not just a calculation?

Convince a skeptic

Turn a pattern into a proof.

The claim

A matching is maximum exactly when no augmenting path exists.

Build the argument

An augmenting path can be flipped to make the matching larger.
If a larger matching existed, the symmetric difference would contain an augmenting path.
Therefore absence of one proves maximal size.

What does each step rely on? Where are the conditions used?

Stretch together

Take the idea somewhere new.

Transfer challenge

Give a bipartite graph satisfying Hall's condition but having more right vertices than left vertices.

Choose a route

Name the objects, the conditions, and a relationship that might help. Start with one test case.

What transfers from the earlier example? What is different?

Peer review

Check the argument together.

Restate

Explain the other person’s route before evaluating it.

Test

Try a small case or boundary case. Does every step still make sense?

Revise

Fix an assumption, add a reason, or find a second method.

Where did your thinking change?

Beyond this problem

Where might this idea help?

A connection

Matchings model jobs, school choices, organ exchange, and resource assignment.

Discuss the model

What objects or quantities are represented?
Which relationship from today is preserved?
What assumption would you check before trusting it?

Invent one more situation with the same structure.

Exit ticket

Leave with an explanation.

Question 1

Can a graph with an odd number of vertices have a perfect matching?

Question 2

Explain why this claim is true: A matching is maximum exactly when no augmenting path exists.

Question 3

Give a bipartite graph satisfying Hall's condition but having more right vertices than left vertices.

Choose one. Write an answer with a reason, then compare with a partner.

Reflect together

Make your thinking visible.

I used to think…

Name a claim or approach that changed.

Now I can explain…

Give the reason, not only the result.

I still wonder…

Write a question worth bringing to the next circle.

Share one sentence. Ask one follow-up question.

The idea to keep

Alternating paths turn a local reassignment into a globally larger pairing.

Use the matching practice sets to move from direct examples to proof and transfer.

A good question belongs to everyone in the room.