Disjoint compatibility graph of non-crossing matchings of points in convex position

preprint2014arXivOpen access

Abstract

Let X2kX_{2k} be a set of 2k2k labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of X2kX_{2k}. Two such matchings, MM and M′M', are disjoint compatible if they do not have common edges, and no edge of MM crosses an edge of M′M'. Denote by DCMk\mathrm{DCM}_k the graph whose vertices correspond to such matchings, and two vertices are adjacent if and only if the corresponding matchings are disjoint compatible. We show that for each k≥9k \geq 9, the connected components of DCMk\mathrm{DCM}_k form exactly three isomorphism classes -- namely, there is a certain number of isomorphic small components, a certain number of isomorphic medium components, and one big component. The number and the structure of small and medium components is determined precisely.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.