D1 Matchings

http://filestore.aqa.org.uk/subjects/AQA-MD01-QP-JAN12.PDF

For question 2 b) of this paper, I don't know basically.

Could someone walk me through the logic behind why a complete matching is possible ( in a way that gets you the marks)

thanks

Reply 1

ghostwalker

Original post by hi-zen-berg

For question 2 b) of this paper, I don't know basically.

Could someone walk me through the logic behind why a complete matching is possible ( in a way that gets you the marks)

thanks

A complete matching isn't possible.

Consider D must match with 3, and D must match with 4.
But D can't match with both 3 and 4, so a complete matching is impossible.

Reply 2

hi-zen-berg

Original post by ghostwalker

A complete matching isn't possible.

Consider D must match with 3, and D must match with 4.
But D can't match with both 3 and 4, so a complete matching is impossible.

cheers;

so do you think a good way to answers these Qs in a succinct way would be;

to look for a vertex (LHS) that can only match to one other (RHS)

therefore another vertex (LHS) has only one vertex it can now connect to (RHS)

and so on, until there are two unmatched vertices one side and one unmatched on the opposite side

you don't have to reply i was basically mapping it out in my own head looool

thanks again