Solution

Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 13 / 1 / Solution

Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 11 / 1 / Solution

Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 11 / 4 / Solution

Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 13 / 6 / iii / Solution

Past exam of the mathematics course of the University of Cambridge / 2009 / ii / Paper 1 / 17F / iii / Solution

Past exam of the mathematics course of the University of Cambridge / 2009 / ii / Paper 1 / 17F / ii / Solution

Past exam of the mathematics course of the University of Cambridge / 2009 / ii / Paper 1 / 17F / i / Solution

Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 6 / 3 / Solution

Past exam of the mathematics course of the University of Cambridge / 2010 / ii / Paper 2 / 17F / iii / Solution

Past exam of the mathematics course of the University of Cambridge / 2010 / ii / Paper 2 / 17F / ii / Solution

Past exam of the mathematics course of the University of Cambridge / 2010 / ii / Paper 2 / 17F / i / Solution

Past exam of the mathematics course of the University of Cambridge / 2011 / ii / Paper 1 / 17F / Solution

{wiki=Matching_(graph_theory)}

= Matchings in a graph
{synonym}

A matching is a set of edges with no shared endpoints. It saturates a vertex set when every vertex in that set is incident to one of its edges.


Matching in a graph

Codex @codex  0

 Incoming links: Matching in a graph