| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2004 |
| Session | January |
| Marks | 6 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Matchings and Allocation |
| Type | Bipartite graph definition or properties |
| Difficulty | Easy -2.0 This is a pure definition recall question worth 6 marks total, requiring no problem-solving, calculation, or application. Students simply need to reproduce memorized definitions from the D1 specification, making it significantly easier than average A-level questions which typically require some mathematical work or reasoning. |
| Spec | 7.02f Bipartite test: colouring argument |
Define the terms
\begin{enumerate}[label=(\alph*)]
\item bipartite graph, [2]
\item alternating path, [2]
\item matching, [1]
\item complete matching. [1]
\end{enumerate}
\hfill \mbox{\textit{Edexcel D1 2004 Q1 [6]}}