Flips in Odd Matchings

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

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

NATURVETENSKAP  -- Matematik -- Geometri (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Geometry (hsv//eng)

Publication and Content Type

ref (subject category)

kon (subject category)