Let P be a set of n = 2m + 1 points in the plane in general position. We define the graph GM_P whose vertex set is the set of all plane matchings on P with exactly m edges. Two vertices in GM_P are connected if the two corresponding matchings have m − 1 edges in common. In this work we show that GM_P is connected.