In graphs, we often want to find matchings (sets of edges such that no two edges share a common vertex) with particular properties.  We discuss algorithms and properties of matchings, with practical applications.  No previous graph theory knowledge is expected.