20.500.12556/RUL-167823 Connected matchings We show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an upper bound, we show that for some planar point sets in general position the largest matching whose segments form a connected set has $\lceil \frac{n-1}{3}\rceil$ edges. We also consider a colored version, where each edge of the matching should connect points with different colors. point sets matchings for point sets intersection graph true false true Angleški jezik Ni določen Članek v reviji 2025-03-13 13:01:11 2025-03-13 13:01:13 2025-03-14 03:56:02 0000-00-00 00:00:00 2025 0 0 15 str. art. 102174 Vol. 129 Dec. 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17:004 0925-7721 10.1016/j.comgeo.2025.102174 228691203 1-s2.0-S0925772125000124-main.pdf 1-s2.0-S0925772125000124-main.pdf 1 2A390E774F37C0D17242DE3A33F846B6 605faffebd60aab1b2ef34b87ad08e4747ff85cf402cfa93b6319d6bb200cd77 3fb8d914-0002-11f0-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=200628 https://www.sciencedirect.com/science/article/pii/S0925772125000124 1 e034e6a4-0001-11f0-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=200627 Fakulteta za matematiko in fiziko 0 0 0