English

Packing Plane Perfect Matchings into a Point Set

Computational Geometry 2015-01-16 v1 Discrete Mathematics

Abstract

Given a set PP of nn points in the plane, where nn is even, we consider the following question: How many plane perfect matchings can be packed into PP? We prove that at least log2n2\lceil\log_2{n}\rceil-2 plane perfect matchings can be packed into any point set PP. For some special configurations of point sets, we give the exact answer. We also consider some extensions of this problem.

Cite

@article{arxiv.1501.03686,
  title  = {Packing Plane Perfect Matchings into a Point Set},
  author = {Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel Smid},
  journal= {arXiv preprint arXiv:1501.03686},
  year   = {2015}
}
R2 v1 2026-06-22T08:02:24.744Z