Crossing and intersecting families of geometric graphs on point sets
-
Published:2024-01-25
Issue:1
Volume:40
Page:
-
ISSN:0911-0119
-
Container-title:Graphs and Combinatorics
-
language:en
-
Short-container-title:Graphs and Combinatorics
Author:
Álvarez-Rebollar J. L.ORCID, Cravioto-Lagos J., Marín N.ORCID, Solé-Pi O.ORCID, Urrutia J.ORCID
Abstract
AbstractLet S be a set of n points in the plane in general position. Two line segments connecting pairs of points of Scross if they have an interior point in common. Two vertex-disjoint geometric graphs with vertices in Scross if there are two edges, one from each graph, which cross. A set of vertex-disjoint geometric graphs with vertices in S is called mutually crossing if any two of them cross. We show that there exists a constant c such that from any family of n mutually-crossing triangles, one can always obtain a family of at least $$n^c$$
n
c
mutually-crossing 2-paths (each of which is the result of deleting an edge from one of the triangles) and provide an example that implies that c cannot be taken to be larger than 2/3. Then, for every n we determine the maximum number of crossings that a Hamiltonian cycle on a set of n points might have, and give examples achieving this bound. Next, we construct a point set whose longest perfect matching contains no crossings. We also consider edges consisting of a horizontal and a vertical line segment joining pairs of points of S, which we call elbows, and prove that in any point set S there exists a family of $$\lfloor n/4 \rfloor $$
⌊
n
/
4
⌋
vertex-disjoint mutually-crossing elbows. Additionally, we show a point set that admits no more than n/3 mutually-crossing elbows. Finally we study intersecting families of graphs, which are not necessarily vertex disjoint. A set of edge-disjoint graphs with vertices in S is called an intersecting family if for any two graphs in the set we can choose an edge in each of them such that they cross. We prove a conjecture by Lara and Rubio-Montiel (Acta Math Hung 15(2):301–311, 2019, https://doi.org/10.1007/s10474-018-0880-1), namely, that any set S of n points in general position admits a family of intersecting triangles with a quadratic number of elements. For points in convex position we prove that any set of 3n points in convex position contains a family with at least $$n^2$$
n
2
intersecting triangles.
Funder
Massachusetts Institute of Technology
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Aichholzer, O., Kyncl, J., Scheucher, M., Vogtenhuber, B., Valtr, P.: On crossing-families in planar point sets. Comput. Geom. 107, 101899 (2022). https://doi.org/10.1016/j.comgeo.2022.101899 2. Alon, N., Pach, J., Pinchasi, R., Radoičić, R., Sharir, M.: Crossing patterns of semi-algebraic sets. J. Combin. Theory Ser. A 111(2), 310–326 (2005). https://doi.org/10.1016/j.jcta.2004.12.008 3. Álvarez-Rebollar, J.L., Cravioto-Lagos, J., Urrutia, J.: Crossing families and self crossing hamiltonian cycles. XVI Encuentros de Geometría Computacional, pp. 13–16 (2015). https://dccg.upc.edu/egc15/en/wp-content/uploads/2013/10/AbstractsXVIEGC.pdf 4. Aronov, B., Erdős, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica 14(2), 127–134 (1994). https://doi.org/10.1007/BF01215345 5. Bárány, I., Valtr, P.: A positive fraction Erdős–Szekeres theorem. Discrete Comput. Geom. 19(3), 335–342 (1998). https://doi.org/10.1007/PL00009350
|
|