Study Guide 
Tucker: Applied Combinatorics 
§4.4 Algorithmic Matching 
Dr. Lee Eimers

Introduction: In this section, we apply network flows to the theory of matchings.

Concepts and Vocabulary:
The following boldfaced (or italic) terms and phrases introduced in this section.
 
Bipartite Graph
Edge cover
Independent Edges
 		Matching
Matching Network
Maximal Matching
 		Set of Distinct Representatives
X-Matching
 
Points of Interest:

1.   The Lemma and the theorems are very important for matching problems.  Know what they say and how to apply them to help you with finding solutions.

Homework Assignment:
#2, 3, 7, 11, 15
.
 Thought for the Day
Darkness cannot drive out darkness; only light can do that.
Hate cannot drive out hate; only love can do that.
-- Martin Luther King Jr.--