Graph Theory
Matchings
Matthew dreher
History
• 9th century AD. In Rudraṭa's Kavyalankara with the knights
tour
• One of the first writing on graph theory was by Euler in 1736
on the Seven Bridges of Königsberg problem
• First graph theory book was made by a Hungarian
mathematician Dénes Kőnig in 1936 (theory of finite and
infinite graphs)
Distinct representatives
• Suppose that {, ,} is a collection of n>=2 finite nonempty
sets
• The system of sets is said has a Distinct representatives if
there exists n distinct elements , ,.., such that
• Therefore there is a subgraph that is a one-to-one mapping
Distinct representatives
• While it’s a necessary condition that … >=n for a system to
be a Distinct representatives it’s not a sufficient condition
• Hall’s Theorem: A collection {S1, S2,..., Sn} of n nonempty
finite sets has a system of distinct representatives if and only
if, for each integer k with 1 ≤ k ≤ n, the union of any k of
these sets contains at least k elements
Matchings
• Let U = {, ,..., } and W = ∪ ∪···∪ , |W|>=n
• Construct a bipartite a graph G between U and where U are
the sets nd the vertices in W are the elements belonging to
the union of the
• sets has a system of distinct representatives if and only if the
graph G has n edges, no two of which are adjacent. A
collection of edges
Hall’s Marriage Theorem
• Hall’s Theorem: Let G be a bipartite graph with partite sets U
and W such that r = |U|≤|W|. Then G contains a matching of
size r if and only if |N(X)|≥|X| for every nonempty subset X of
U
Maximum Matching
• In any graph, let M be a subgraph G is a maximum matching
if M has the maximum size among all matchings in G
• M is a perfect matching if vertex of G is incident with some
edge of M, it a necessary condition that G has a even number
of vertices
Finding a maximum matching
• Input: let G be a bipartite made of set x and y and let U be the set of
unmatched vertices in X, output a maximum matching
• Initialization: let S=U and T= empty set
• Initialization: If S has no unmarked vertex, stop and report T union(X -S) as
amaximum matching
• Otherwise, select an unmarked x S. For each y N(x) with xy M, if y is
unmatched, terminate and report an M-augmenting path from U to y;
otherwise, y is matched to some w X by M, then include y in T and include
w in S. After exploring all such edges, mark x and iterate
Tutte's theorem
• A graph, G = (V, E), has a perfect matching if and only if for
every subset U of V, the subgraph induced by V − U has at
most |U| connected components with an odd number of
vertices
Stable marriage problem
• Def: A perfect matching is a stable matching if it yields no
unstable unmatched pair, that is, (x, a),(y, b) are matched, but x
prefers b to a, and b prefers x to y.
• Gale-Shapley Proposal Algorithm (1962):
• Each man and each woman have a preference list
• At each round, man proposes to its top choice who has not reject him yet.
• Each proposed woman choose to accept or reject the proposing man
according to her preference list.
example
• Let x=a,b,c and y=d,e,f
• preference list
A(d,e,f),B(d,f,e),c(f,e,d),d(a,b,c),e(c,a,b),f(b,c,a)
a d a d a d
b e b e b e
c f c f c f
Refences
• Benjamin, Arthur, et al. The Fascinating World of Graph
Theory. Princeton University Press, 2015. JSTOR,
www.jstor.org/stable/j.ctt9qh0pv. Accessed 2 Nov. 2020.
