Abstract for talk by Cláudio Lucchesi

Title: A characterization of PM-compact bipartite and near-bipartite graphs
 
The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. In this talk, we characterize bipartite and near-bipartite graphs whose perfect matching polytopes have diameter 1 (it is a clique).