Edexcel Decision 1 Graphs
Introductory questions
1. A department of five sports teachers were each asked their favoured sports to coach.
Their answers are shown in this table:
Mrs Angel Hockey, Tennis, Basketball
Mr Bhatti Football, Cricket
Mr Cole Football, Cricket, Rugby
Miss Denver Tennis, Swimming, Rugby
Mr Evans Football, Basketball, Hockey
Draw a bipartite graph to show this information
2. A firm of translators has five employees with the following specialisms:
Anya Spanish, Italian
Bruce German, Japanese
Carol Italian, Spanish, Japanese
Diane French, German
Ewan Spanish, French
a. Draw a bipartite graph to show this information
Their manager allocates Anya, Bruce, Carol and Diane to roles utilising the first
language in their list.
b. Starting from this matching, use the maximum matching algorithm to find a
complete matching.
You must show sufficient working to indicate that you have used the
algorithm.
3. At a school summer fair, six students A, B, C, D, E and F are to run six stalls R, S, T,
U, V and W.
Each students preferences are shown in the table below
A S, R, W
B U, S
C V
D T, R
E T, V
F V, R
a. Draw a bipartite graph to show this information
Initially students A, B, D and F are matched to their first choices
b. Indicate this initial matching in a distinctive way on your bipartite graph
1 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
c. Use the maximum matching algorithm to find a maximum matching listing
your alternating path clearly
d. Why is it not possible to find a complete matching?
C grudgingly accepts that she could also run stall S
e. Draw a new bipartite graph showing this information
f. Find a complete matching starting from the initial matching used in b.
2 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
Solutions to introductory questions
1. A department of five sports teachers were each asked their favoured sports to coach.
Their answers are shown in this table:
Mrs Angel Hockey, Tennis, Basketball
Mr Bhatti Football, Cricket
Mr Cole Football, Cricket, Rugby
Miss Denver Tennis, Swimming, Rugby
Mr Evans Football, Basketball, Hockey
Draw a bipartite graph to show this information
A C
B F
C H
D R
E S
2. A firm of translators has five employees with the following specialisms:
Anya Spanish, Italian
Bruce German, Japanese
Carol Italian, Spanish, Japanese
Diane French, German
Ewan Spanish, French
a. Draw a bipartite graph to show this information
A F
B G
C I
D J
E S
Their manager allocates Anya, Bruce, Carol and Diane to roles utilising the first
language in their list.
b. Starting from this matching, use the maximum matching algorithm to find a
complete matching.
3 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
You must show sufficient working to indicate that you have used the
algorithm.
A F
B G
C I
D J
E S
Alternating path:
F=DG=BJ
E
S=AI=CJ
Either
E F = D G = B J becomes E = F D = G B = J
Corresponding to the complete matching
Anya Spanish (unchanged from initial matching)
Bruce Japanese
Carol Italian (unchanged from initial matching)
Diane German
Ewan French
Or
E S = A I = C J becomes E = S A = I C = J
Corresponding to the complete matching
Anya Italian
Bruce German (unchanged from initial matching)
Carol Japanese
Diane French (unchanged from initial matching)
Ewan Spanish
3. At a school summer fair, six students A, B, C, D, E and F are to run six stalls R, S, T,
U, V and W.
Each students preferences are shown in the table below
A S, R, W
B U, S
C V
D T, R
E T, V
F V, R
4 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
a. Draw a bipartite graph to show this information
A R
B S
C T
D U
E V
F W
Initially students A, B, D and F are matched to their first choices
b. Indicate this initial matching in a distinctive way on your bipartite graph
A R
B S
C T
D U
E V
F W
c. Use the maximum matching algorithm to find a maximum matching listing
your alternating path clearly
C V = F R becomes C = V F = R
Corresponding to the matching
AS
BU
CV
DT
FR
E and W are unmatched
Second iteration
A R
B S
C T
D U
E V
F W
5 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
Alternating path
T = D R = F V = C cant get any further
E
V = C cant get any further
No alternating path exists so the current matching is maximal
d. Why is it not possible to find a complete matching?
For a complete matching W must be done by A and U must be done by B but
S needs either A or B so there cant be a complete matching
C grudgingly accepts that she could also run stall S
e. Draw a new bipartite graph showing this information
A R
B S
C T
D U
E V
F W
f. Find a complete matching starting from the initial matching used in b.
A R
B S
C T
D U
E V
F W
First iteration (starting with C):
Alternating path:
R
S=A W
C
V=FR
Giving three possibilities, all equally valid (you only need give one)
6 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
CS=AR CS=AW CV=FR
C=SA=R C=SA=W C=VF=R
Giving Giving Giving
AR AW AS
BU BU BU
CS CS CV
DT DT DT
FV FV FR
E and W are unmatched E and R are unmatched E and W are unmatched
Iteration 2 for possibility 1
A R
B S
C T
D U
E V
F W
Alternating path
T=DR=AW
E
V=FR=AW
Either E T = D R = A W becomes E = T D = R A = W
Giving
AW
BU
CS
DR
ET
FV
Or E V = F R = A W becomes E = V F = R A = W
Giving
AW
BU
CS
DT
EV
FR
There are three possible complete matchings:
AW AW AW
BU BU BU
7 of 8 19/02/13 MEI
Edexcel D1 Graphs 2 Introductory questions
CS CS CS
DR DT DR
ET EV ET
FV FR FV
8 of 8 19/02/13 MEI
