T9 - G that avoids e . Problem 3: Let G be a bipartite...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Problem 1: Let M be a maximum matching of a graph G . Let N be any other matching of G . Let H be the subgraph of G whose edges are ( M N ) \ ( M N ) and whose vertices are the vertices of G . Show that if every component of H is a cycle then N is also a maximum matching of G . Problem 2: Let G be a graph, and e be a bridge of G . Show that if there is one perfect matching of G that contains e , then every perfect matching of G contains e . Give an example where there is a maximum matching of G that contains e , but also a maximum matching of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: G that avoids e . Problem 3: Let G be a bipartite graph with q edges and maximum degree . Prove that G has a matching of size at least q . Give an example of a graph G (not bipartite) that has q edges, maximum degree , and no matching of size at least q . Problem 4: Exercise 6 from Problem Set 7.2 in the course notes. (Or some other example of the bipartite maximum matching algorithm if your instructor did that one in class.) 1...
View Full Document

Ask a homework question - tutors are online