Maximum matching graph

Maximum matching graph --- граф наибольших паросочетаний.

The maximum matching graph of a graph [math]\displaystyle{ G }[/math] has a vertex for each maximum matching and an edge for each pair of maximum matchings which differ by exactly one edge.