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
- Spring '09
- Math, Bipartite graph, Dulmage–Mendelsohn decomposition, maximum matching