Speaker: Paul Elliott, University of Ottawa 
Time:    Tuesday January 27, 11:00-12:00 
Place:   room STE5084, SITE Building, University of Ottawa 
Title:   "Maximum Matching Graphs" 

Abstract:
A maximum matching graph, M(G), of a graph G is a
graph whose vertices are labelled by the maximum
matchings of G and where two vertices are adjacent iff
their corresponding maximum matchings differ in
exactly one edge in G.  We will explore some of the
basic properties of maximum matching graphs.  We will
also establish some results about which graphs are not
maximum matching graphs, placing special emphasis on
those maximum matching graphs which are disconnected. 
Only a basic knowledge of graph theory is assumed.