Matchings

We have two distinct sets of vertices with some edges between the two sets but no edges within a set.  The aim is to find as large as possible a subset of the edges with no two edges sharing a vertex.

• Teachers notes (Word document or PDF)
• Topic Introduction Presentation (Powerpoint)
• Student exercise (Word document or PDF)