Packing Plane Perfect Matchings into a Point Set
classification
💻 cs.CG
cs.DM
keywords
planematchingsperfectpointconsiderpackedsomeanswer
read the original abstract
Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? We prove that at least $\lceil\log_2{n}\rceil-2$ plane perfect matchings can be packed into any point set $P$. For some special configurations of point sets, we give the exact answer. We also consider some extensions of this problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.