we trace an example: boys, girls, edges . Start with boy , match him to girl . Boy matches to girl . Boy matches to girl . Matching size = . This is a perfect matching. Now try .
Boy matches girl . Boy tries girl , she's taken. DFS tries to rematch boy , but he has no other options. The attempt fails. Final matching size = . This shows why some graphs have smaller matchings.