Scribd
Upload
50 views

Assignment 3

This document contains 11 problems related to graph theory and stable matching. The problems cover topics like finding a maximum matching and minimum vertex cover in a graph, properties of maximal and maximum matchings, matchings in bipartite graphs, and the Gale-Shapley algorithm for finding stable matchings. The document provides examples of graphs, matchings, and preference lists to be used in solving the problems.

Uploaded by

man human
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

Assignment 3

This document contains 11 problems related to graph theory and stable matching. The problems cover topics like finding a maximum matching and minimum vertex cover in a graph, properties of maximal and maximum matchings, matchings in bipartite graphs, and the Gale-Shapley algorithm for finding stable matchings. The document provides examples of graphs, matchings, and preference lists to be used in solving the problems.

Uploaded by

man human
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Graph Theory IISER Pune September 2022

Assignment 3

1. Find a maximum matching and a minimum vertex cover in the graph below. To
find maximum matching, use augmenting path algorithm starting with matching M =
{(C, G), (D, H)}. Clearly mention augmenting path and updated matching at each it-
eration, starting from the matching M = {(C, G), (D, H)}.

2. Show that in any graph G = (V, E) the size of any maximal matching is at least half
the size of a maximum matching.

3. Consider a bipartite graph G = (A ∪ B, E). Assume that for some vertex set A1 ⊆ A
and B1 ⊆ B, there exists a A1 -saturated matching MA1 and a B1 -saturated matching
MB1 . Prove that there always exists a matching covering all vertices of A1 ∪ B1 .

4. Prove that the size of maximum independent set in G is always greater than or equal to
n
1+∆(G)
.

5. Prove that a bipartite graph with maximum degree d is the union of d edge-disjoint
matchings.

6. Let G be any bipartite graph and and suppose that k ≥ 1. Then G is the union of k
edge disjoint spanning subgraphs G1 , G2 , . . . , Gk such that

d(x) d(x)
b c ≤ dGi (x) ≤ d e
k k
for each x ∈ V (G)

7. Let G be a bipartite graph with δ(G) = r. Then G is the union of r disjoint edge-covers.

8. Consider the following instance:

Find the woman-oriented stable matching obtained by Gale-Shapley algorithm.


m1 w1 w2 w3 w4
m2 w1 w4 w3 w2
m3 w2 w1 w3 w4
m4 w4 w2 w3 w1

Table 1: Men’s preference

w1 m4 m3 m1 m2
w2 m2 m4 m1 m3
w3 m4 m1 m2 m3
w4 m3 m2 m1 m4

Table 2: Women’s preference

9. Decide whether the following statement is true of false. If it is true give a short expla-
nation. If it is false, give a counterexample.
In every instance of the stable matching problem, there is a stable matching containing
a pair (m, w) such that m is ranked first on the preference list of w and w is ranked first
on the preference list of m.

10. Decide whether the following statement is true of false. If it is true give a short expla-
nation. If it is false, give a counterexample.
Consider an instance of the stable matching problem in which there exists a man m and
an woman w such that m is ranked first on the preference list of w and w is ranked first
on the preference list of m. Then in every stable matching M for this instance, the pair
(m, w) belongs to M .

11. Prove that in the man-oriented stable matching obtained by Gale-Shapley algorithm,
each man has the best partner that he can have in any stable matching.

You might also like