A matching is a set of edges on a bipartite graph in which no two edges share a common vertex. A bipartite graph consists of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y. A matching in a bipartite graph is the pairing of some or all of the vertices in X with some or all of the vertices in Y. If every vertex in X is paired with a Y vertex the matching is said to be a complete matching. This problem requires a student to choose their AS level subjects from a series of option blocks.
Matchings: presentation - an introduction to the problem outlining the student task and putting the task into context.
Matchings: problem - a student version of the problem outlined in the introduction.
Matchings: solution - one possible suggested solution for the problem.
The OR Society have developed these problems for use in Decision mathematics lessons. The problems can be used as an introduction to a topic, part of the learning process or as a plenary exercise.
Show health and safety information
Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.