2025/08/24 by Antić, Todor, Balko, Martin, Vogtenhuber, Birgit
#Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #G.2
paper · doi:10.48550/arxiv.2508.17277
For a finite set P of points in the plane in general position, a crossing family of size k in P is a collection of k line segments with endpoints in P that are pairwise crossing. It is a long-standing open problem to determine the largest size of a crossing family in any set of n points in the plane in general position. It is widely believed that this size should be linear in n. Motivated by results from the theory of partitioning complete geometric graphs, we study a variant of this problem for point sets P that do not contain a non-crossing family of size m, which is a collection of 4 disjoint subsets P1, P2, P3, and P4 of P, each containing m points of P, such that for every choice of 4 points pi ∈ Pi, the set \p1,p2,p3,p4\ is such that p4 is in the interior of the triangle formed by p1,p2,p3. We prove that, for every m ∈ ℕ, each set P of n points in the plane in general position contains either a crossing family of size n/2^O(√logm) or a non-crossing family of size m, by this strengthening a recent breakthrough result by Pach, Rubin, and Tardos (2021). Our proof is constructive and we show that these families can be obtained in expected time O(nm1+o(1)). We also prove that a crossing family of size Ω(n/m) or a non-crossing family of size m in P can be found in expected time O(n).