An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane

: Let P be a set of n ≥ 3 points in general position in the plane. The edge disjointness graph D ( P ) of P is the graph whose vertices are the ( n 2 ) closed straight line segments with endpoints in P , two of which are adjacent in D ( P ) if and only if they are disjoint. In this paper we show that the connectivity of D ( P ) is at most 7 n 2 18 + Θ ( n ) , and that this upper bound is asymptotically tight. The proof is based on the analysis of the connectivity of D ( Q n ) , where Q n denotes an n -point set that is almost 3-symmetric.


Introduction
We call set in general position to any finite set of points in the Euclidean plane that does not contain three collinear elements. Let P be a set of n ≥ 3 points in general position. A segment of P is a closed straight line segment with its two endpoints being elements of P. In this paper, we shall use P to denote the set of all ( n 2 ) segments of P. The edge disjointness graph D(P) of P is the graph whose vertex set is P, and two elements of P are adjacent in D(P) if and only if they are disjoint. We note that P naturally defines a rectilinear drawing in the plane of the complete graph K n on n vertices. See Figure 1.
The class of edge disjointness graphs was introduced in 2005 by Araujo, Dumitrescu, Hurtado, Noy, and Urrutia [1], as a geometric version of the Kneser graphs. We recall that for k, m ∈ Z + with k ≤ m/2, the Kneser graph KG(m; k) is defined as the graph whose vertices are all the k-subsets of {1, 2, . . . , m} and in which two k-subsets from an edge if and only if they are disjoint. In 1956, Kneser conjectured [2] that the chromatic number χ(KG(m; k)) of KG(m; k) is equal to m − 2k + 2. This conjecture was proved by Lovász [3] and (independently) by Bárány [4] in 1978. For more results on Kneser graphs, we refer the reader to [5][6][7][8][9][10] and the references therein.
In [1] the effort was focussed on the estimation of the chromatic number χ(D(P)) of D(P), and a general lower bound was established. The problem of determining the exact value of χ(D(P)) remains open in general. On the other hand, there are only two families of point sets for which the exact value of χ(D(P)) is known: when P is in convex position [11,12], and when P is the double chain [13]. The connectivity κ(D(P)) of D(P) was studied by Leaños, Ndjatchi, and Ríos-Castro in [14], where it was shown that κ(D(P)) ≥ 2 ). We remark that in this paper we give a complementary upper bound for κ(D(P)).
Recently, Aichholzer, Kynčl, Scheucher, and Vogtenhuber [15] have established an asymptotic upper bound for the maximum size of certain independent sets of vertices of D(P). In 2017 Pach, Tardos, and Tóth [16] studied the chromatic number and the clique number of D(P) in the more general setting of R d for d ≥ 2, i.e., when P is a subset of R d . More precisely, in [16] was shown that the chromatic number of D(P) is bounded by above by a polynomial function that depends on its clique number ω(D(P)), and that the problem of determining any of χ(D(P)) or ω(D(P)) is NP-hard. Two years later, Pach and Tomon [17] have shown that if G is the disjointness graph of a set of grounded x-monotone curves in R 2 and ω(G) = k, then χ(G) ≤ k + 1.
Another wide research area, which is closely related to this work, is the study of the combinatorial properties of geometric graphs. We recall that a geometric graph is a graph whose vertex set V is a finite set of points in general positions in the plane, and the edges are straight line segments connecting some pairs of V. Clearly, the sets of segments studied in this paper correspond to a class of the geometric graph, namely the class of complete geometric graphs. See [18] for an excellent survey on geometric graphs.
Following [14], if x, y ∈ P and x = y, then xy will be the element of P with endpoints x and y. Let x 1 y 2 and y 1 x 2 be two distinct elements of P, and suppose that x 1 y 2 ∩ y 1 x 2 = ∅. Then x 1 y 2 ∩ y 1 x 2 consists precisely of one point o ∈ R 2 , because P is a set in general position. If o is an interior point of both x 1 y 2 and y 1 x 2 , then we say that they cross at o, and we will refer to o as a crossing of P. See Figure 1 (upper right). , x 2 , y 1 , y 2 , z 1 , z 2 } on the upper left is a set in general position. In the upper right we have P, which can be seen as the rectilinear drawing of K 6 induced by P. As the largest number of crossings on any segment of P is 1, then lcr(P) = 1. The graph on the bottom part is the edge disjointness graph D(P) corresponding to P.
Let H = (V(H), E(H)) be a (non-empty) simple connected graph. As usual, if u, v ∈ V(H), then the distance between u and v in H will be denoted by d H (u, v), and we write uv to mean that u and v are adjacent in H. We note that the uv notation is similar to that used to denote the straight line segment xy defined by the points x, y ∈ P. However, none of these notations should be a source of confusion, because the former objects are vertices of a graph, and the latter are points in the plane.
The neighborhood of v in H is the set {u ∈ V(H) : uv ∈ E(H)} and is denoted by  Figure 2. This graph is 2-connected, but not 3-connected. Indeed, if we remove any vertex, what remains is still connected. On the other hand, note that U = {u 1 , u 2 } is vertex cut of order 2, and hence U is a vertex cut of minimum order.
Our aim in this paper is to show the following result. Theorem 1. Let P be a set of n ≥ 3 points in general positions in the plane. Then κ(D(P)) ≤ 7 18 n 2 + Θ(n), and this bound is asymptotically tight.
The rest of the paper is organized as follows. The validity of inequality in Theorem 1 is proved in Section 2, by making strong use of the main result of Ábrego and Fernández-Merchant in [19]. In Section 3 we briefly explain the strategy to prove Theorem 1 and present the key ingredients of our proof. Finally, in Section 4, we show that the upper bound in Theorem 1 is asymptotically tight, by proving that κ(D(Q n )) = 7 18 n 2 − Θ(n) for certain infinite family {Q n } ∞ n=3 of point sets in general position with certain symmetry property.

The Rectilinear Local Crossing Number of K n and the Validity of Inequality in Theorem 1
In what follows n is an integer with n ≥ 3, and P is an n-point set in general position. Our aim in this section is to show that κ(D(P)) ≤ 7 18 n 2 + Θ(n). In order to do that, we need to establish a straightforward, yet essential, relationship between the minimum degree δ(D(P)) of the graph D(P) and the rectilinear local crossing number of the drawing P of K n induced by P.
We recall that the rectilinear local crossing number of P denoted by lcr(P), is the largest number of crossings on any element of P, and that the rectilinear local crossing number of K n denoted by lcr(K n ), is the minimum of lcr(P) taken over all n-point sets P in general position. See Figure 1 (upper right).

Proposition 2.
The minimum degree δ(D(P)) of the graph D(P) is equal to ( n−2 2 ) − lcr(P). Proof. Let e = xy be an element of P, and let E be the subset of P consisting of all segments that cross e. From the definitions of e and E it follows that an element of P \ {e} is adjacent to e in D(P) if and only if has both endpoints in P \ {x, y} and does not belong to E . Since |P| = n, then the degree of e in D(P) is exactly ( n−2 2 ) − |E |. The last fact and |E | ≤ lcr(P) imply δ(D(P)) ≥ ( n−2 2 ) − lcr(P). On the other hand, from the definition of lcr(P) we know that P contains a segment, say g, that is crossed by exactly lcr(P) elements of P \ {g}, and hence the degree of g in D(P) is ( n−2 2 ) − lcr(P), as required. The following result was proved in [19] and is the key ingredient in the proof of Corollary 4.

The Key Ingredients of the Proof of Theorem 1
Our strategy to prove that the upper bound in Theorem 1 is asymptotically tight is as follows. First, for any integer n with n ≥ 3, we define a certain n-point set in a general position, which we denote by Q n . The family {Q n } ∞ n=3 was originally defined by Lara, Rubio-Montiel and Zaragoza in [20], where it was shown that lcr(K n ) = 1 9 n 2 − Θ(n). More recently, Ábrego and Fernández-Merchant [19] showed that lcr(K n ) = lcr(Q n ) for any n ≡ 2 ( mod 3). Then, we will give some notation and basic facts related to the connectivity of D(Q n ), which will allow us to simplify the remaining part of the proof of Theorem 1. Finally, in Section 4.2, we will show that κ(D(Q n )) = 7 18 n 2 − Θ(n). We now recall a couple of classical results in graph theory which are fundamental in our proof.

Theorem 6 (Menger's theorem). A graph is k-connected if and only if it contains k pairwise internally disjoint paths between any two distinct vertices.
It is straightforward to check that the graph D(P) is connected for any n-point set P in general position with n ≥ 5. In view of this, the following consequence of Menger's theorem will be useful. Proof. The forward implication follows directly from Menger's theorem. Conversely, let U be a vertex cut of H of minimum order. Let H 1 and H 2 be two distinct components of H \ U, and let u ∈ U. Since U is a minimum cut, then u has at least a neighbor v i in H i , for i = 1, 2. Then d H (v 1 , v 2 ) = 2. By hypothesis, H has k pairwise internally disjoint v 1 − v 2 paths. Since each of these k paths intersects U, then we have that |U| ≥ k, as required.
Another ingredient that plays a central role in this work is the property of 3-symmetry of point sets in the plane, which is a recurrent concept in crossing number theory. A subset X in R 2 is called 3-symmetric if X contains a subset X 1 such that where ρ is a 2π/3 clockwise rotation around a suitable point in the plane. The relationship between the concept of 3-symmetry and several variants of crossing number have been investigated by a number of authors [19][20][21][22]. If X is finite and |X| ≡ 0 (mod 3), then we say that X is almost 3-symmetric if X contains a subset X with at most two elements such that X \ X is 3-symmetric. As we shall see in the next section, the main part of the proof of Theorem 1 is based on the estimation of the connectivity of D(Q n ), where Q n is an almost 3-symmetric set with n points.

The Upper Bound in Theorem 1 Is Asymptotically Tight
For the rest of the paper, n is an integer with n ≥ 3. We begin by introducing the family of point sets that we use in the proof of our main result, and some notation.
n=3 and Its Properties Following [19], let C 0 be the arc of the circumference passing through the points (1, 0), (3, 0), and (2, ), where ∈ R + is close to zero. Let C 1 (resp. C 2 ) be the 2π/3 (resp. 4π/3) counterclockwise rotation of C 0 around the origin O := (0, 0). We choose small enough so that any straight line passing through two distinct points of C 0 separates C 1 from For the rest of the paper, we use Q n to denote the set of all ( n 2 ) segments of Q n , and G n := D(Q n ). Similarly, if a, b ∈ Q n , then η(Q n ; a, b) will denote the maximum number of pairwise internally-disjoint a − b paths in G n . Remark 8. Let a, b be vertices of G n such that d G n (a, b) = 2. By Corollary 7 and Menger's theorem, in order to show the last assertion of Theorem 1 it is enough to show that η(Q n ; a, b) = 7 18 n 2 − Θ(n).
In view of the previous remark, for the rest of the work, we can assume that a and b are two fixed vertices of G n such that d G n (a, b) = 2. Then a and b are not adjacent in G n , and hence a ∩ b = ∅. This inequality and the fact that Q n is a set in general position imply that a ∩ b consists precisely of one point of R 2 , which will be denoted by o. Then either a and b cross at o or o is common endpoint of them.
We note that if e ∈ Q n , then there is a unique i ∈ {0, 1, 2} such that e has an endpoint in C i and the other in C i ∪ C i+2 , where addition is taken mod 3. We will say that such an i is the type of e. In particular, note that in any of the three cases of Figure 3, a and b are of type 0 and 1, respectively.
Clearly, there are only two possibilities for a and b with respect to their types: they have the same type, or they have different types. If a and b have the same type, then, by rotating Q n around O (if necessary) but not the labels C 0 , C 1 , and C 2 , we may assume that a and b are both of type 0. Analogously, if a and b have different types, then, by rotating Q n (if necessary) we can assume that 0 and 1 are the types of a and b.
It is not hard to check that if a and b are of type 0 and 1, respectively, then the three configurations illustrated in Figure 3 are the only possibilities to put the endpoints of a and b on the arcs C 0 , C 1 , and C 2 . Similarly, if a and b are both of type 0, then ten configurations illustrated in Figure 4 are the only possibilities to put the endpoints of a and b on the arcs C 0 and C 2 . Then, from now on, we can assume without any loss of generality that a and b are placed in Q n according to some case of Figures 3 and 4. We abuse notation and we shall use C i to refer to the subset of points of Q n that lies on the arc C i . In particular, we will assume that |C i | = n i . For distinct i, j ∈ {0, 1, 2}, we let C i,j := C i ∪ C j . The difference between these configurations is the way in which the endpoints of a = uv and b = vw are located on C 0 , C 1 , and C 2 .
We now split the set of neighbours of a and b into three sets as follows. Clearly, A, B, D, and {a, b} are pairwise disjoint. We also note that N G n (a) = A ∪ D, N G n (b) = B ∪ D, and hence η(Q n ; a, b) ≤ |D| + min{|A|, |B|}.
Keeping in mind the facts and the terminology given in this subsection, we now proceed to show the last assertion of our main result. . Except for rotations, these ten configurations together with those three in Figure 3, are the only possibilities to put the endpoints of a and b on C 0 , C 1 , and C 2 . The arcs here are not as flat as they should be; we have drawn them in this way for illustrative purposes only.

Constructing the Required a − b Paths of G n
As we have mentioned in Remark 8, all we need to finish the proof of Theorem 1 is to show the following lemma.
Lemma 9. If a and b are as in Remark 8, then η(Q n ; a, b) = 7 18 n 2 − Θ(n). We devote this section to show Lemma 9, and hence to complete the proof of Theorem 1. Our proof is constructive and uses two types of constructions, depending on whether a and b are located in Q n according to some case of Figure 3 or Figure 4. In the interest of readability, we start by presenting several technical issues needed to define both types of constructions.
Since the equality in Lemma 9 is asymptotic, in what remains of this section, we assume that n ≥ 15. Note that this assumption guarantees that each of C 0 , C 1 , and C 2 has at least one point that does not belong to a or b. This will be used in Section 4.2.2.

Suppose That a and b Have Distinct Types
Then, a and b are located in Q n according to some case of Figure 3, and so a = uv, b = vw, v ∈ C 0 , w ∈ C 1 , and u ∈ C 0,2 \ {v}. Let H be the bipartite subgraph of G n with bipartition {A, B} such that f ∈ A is adjacent to g ∈ B in H if and only if f and g are adjacent in G n . Thus, H is an induced bipartite subgraph of G n . If X and Y are nonempty subsets of Q n , we will denote the set of all segments of Q n that have an endpoint in X and the other in Y by X * Y.
A simple inspection of the several cases in which two elements of Q n can cross each other yields the following assertion.
Observation 10. If f , g ∈ Q n cross each other, then f and g are of the same type.
A key fact that will allow us to construct the first class of paths is that H satisfies the Hall's condition. We formalize this idea as follows. Proof. We break the proof into two cases, depending on whether |A| ≤ |B| or |A| > |B|. We remark that Observation 10 is often used in this proof without explicit mention.
(A) Suppose that |A| ≤ |B|, and let S ⊆ A. We can assume that S = ∅ and that B \ N H (S) = ∅, as otherwise we are done. Let e * be a fixed segment of B \ N H (S), and assume that e * = pq.
The next facts follow easily from the choice of e * and S. (F1) e * intersects each element of S ∪ {a}, (F2) b intersects each element of S, and (F3) each element of S has at least one endpoint in C 1 .
(A2) Suppose that p, q ∈ C 0 . Then (F1) and (F3) imply that S is a subset of the set A , which consists of all segments that intersect b and are in {p, q} * C 1 . Then, |S| ≤ |A | ≤ 2n 1 . Let e ∈ S, and assume without loss of generality that p ∈ e. Since e ∩ a = ∅, then p / ∈ {u, v} and B := {u} * (C 0,2 \ {u, v, p}) is a subset of N H (e). Then, |N H (S)| ≥ |B | = n 0 + n 2 − 3, and we can assume that |A | > n 0 + n 2 − 3, as otherwise we are done. This implies that there exists g ∈ S with q ∈ g.
Since u ∈ C 2 implies |A | ≤ n 1 + 1 < n 0 + n 2 − 3, we can assume that u ∈ C 0 . Let I 0 be the set of points of C 0 that are between u and v. From (F1) we know that at most one of p or q is in I 0 . If z ∈ {p, q} is a point of I 0 , then B ∪ ({z} * C 2 ) is a subset of N H ({e, g}). Then |N H (S)| ≥ (n 0 + n 2 − 3) + n 2 ≥ 2n 1 ≥ |S|, as required. Then, neither p nor q is in I 0 . Since e * ∩ a = ∅, we must have u = q. This implies that S ⊆ {p} * C 1 , and so |N H (S)| ≥ n 0 + n 2 − 3 ≥ n 1 ≥ |S|.
(A3) Suppose that p, q ∈ C 2 . Since e * is of type 2 and e * ∩ a = ∅, then u must be a common endpoint of e * and a, by Observation 10. Without loss of generality, suppose that p = u.
From (F1) and (F3) we know that S is a subset of {w} * (Y ∪ {q}), where Y denotes the set of all points of C 2 that lie between u and q. Note that if u and q are consecutive points of C 2 , then Y = ∅. Let e be the segment of S whose endpoint q ∈ Y ∪ {q} is closest to q. Let Y be the set of all points of C 2 that lie between u and q . Then |Y | + 1 ≥ |S|, and B := {u} * (Y ∪ C 0 \ {v}) is a subset of N H (e). Since |S| ≤ |Y | + 1 and |B | = (n 0 − 1) + |Y |, then n 0 ≥ 5 implies |N H (S)| ≥ |S|.
(A4) Suppose that e * has an endpoint in C 1 . We assume without loss of generality that p ∈ C 1 . Clearly, p = w. Since e * ∩ a = ∅, then q = u, and so q ∈ C 0,2 \ {v}.
Let I 0 be the set of points of C 0 that are between u and v (if u and v are contiguous, I 0 = ∅), and let J 0 := C 0 \ (I 0 ∪ {v}). By (F1) and (F2) we know that each segment of S intersects both e * and b. Since b and e * are disjoint, no segment of S can have an endpoint in I 0 ∪ {v}, and, on the other hand, each segment of B must have at least one endpoint in I 0 ∪ {u}. Note that if J 0 has at least two points being incident with segments of S, then each segment of B is disjoint from at least one of these points of J 0 , and hence B ⊆ N H (S), as required.
Thus, we can assume that all segments of S are incident with one point of J 0 , say z. Then, S ⊆ {z} * (C 1 \ {p}) or S ⊆ {z} * (C 1 \ {w}), and so |S| ≤ n 1 − 1 ≤ n 2 . On the other hand, note that {u} * C 2 ⊆ N H (S), and so |N H (S)| ≥ n 2 , as required.
(B) Suppose that |B| < |A|, and let S ⊆ B. We can assume that S = ∅ and that A \ N H (S) = ∅, as otherwise we are done. Let d : R 2 → R ≥0 denote the ordinary euclidean distance in R 2 . For i ∈ {0, 1, 2} and x ∈ C i , we let C >x Note that F w := {w} * (Q n \ {u, v, w}) is a subset of A. Since no segment of B intersects every segment of F w , then at least one segment of F w is in N H (S), and so |N H (S)| ≥ 1. Thus |S| ≥ 2, as otherwise we are done.
Let W 1 be the subset of all points in C 1 that are incident with a segment of S. Then S ⊆ {u} * (W 1 ∪ C 0 \ {u, v}), and so |S| ≤ |W 1 | + n 0 − 2. If W 1 = ∅, then |S| ≤ n 0 − 2 ≤ n 2 = |{w} * C 2 | ≤ |N H (S)|, as required. Then we can assume that W 1 = ∅. Let w be the point in W 1 that is farthest from w. Since any segment in {w} * (B3) Suppose that u ∈ C 2 . Let S be the set of all segments of S that are not incident with u. Suppose first that S = ∅. Then (B1) implies that S has at most one segment in {u} * C 0 . If there exists x ∈ C 0 such that ux ∈ S, then |S| ≥ 2 implies that A ⊆ N H (S), and hence |N H (S)| ≥ |A| > |B| ≥ |S|. Thus, we may assume that S ⊆ {u} * (C 1,2 \ {u, w}). For k = 1, 2, let W k be the subset of all points in C k \ {u, w} that are incident with a segment of S. Then S = {u} * (W 1 ∪ W 2 ), and so |S| = |W 1 | + |W 2 |. If W k = ∅, then we use w k to denote the point in W k that is closest to w if k = 1 (resp. u if k = 2). Since any segment in {w} * (W k \ {w k }) is disjoint from at least one of uw 1 or uw 2 , then Suppose now that S = ∅. Then each segment of S crosses a, and has at least one endpoint in C 0 \ {v}. From (B2) it follows that there is x ∈ C 0 \ {v} such that S ⊆ {x} * C 2 . This fact and (B2) imply the existence of uy ∈ S with y ∈ C 1,2 \ {u, w}. Note that if |S | > 1, then A \ {xy} ⊆ N H (S ∪ {uy}) ⊆ N H (S). On the other hand, if S = {xz} for some z ∈ C 2 \ {u}, then A \ {wz} ⊆ N H ({xz, uy}) ⊆ N H (S). In any case, we have |N H (S)| ≥ |A| − 1 ≥ |B| ≥ |S|.
(B4) Suppose that u ∈ C 0 . Let S u be the set of all segments of S in {u} * (C 1 \ {w}), and let S = S \ S u . Then, any element in S is a segment of type 0. We may assume that S u = ∅, as otherwise we are in (B1) or (B2) due to |S| ≥ 2. Similarly, if S = ∅, then |S| = |S u | ≤ n 1 − 1. From S u = ∅ we have that {w} * C 2 ⊆ N H (S), and so |N H (S)| ≥ n 2 ≥ n 1 − 1 ≥ |S|. Thus, we also assume that S = ∅.

Suppose That a and b Have The Same Type
Then, a and b are located in Q n according to some case of Figure 4. For i = 0, 1, 2 let E i be the set of points in C i that are endpoints of at least one of a and b, and let C i := C i \ E i . Then, 3 ≤ |E 0 | + |E 1 | + |E 2 | ≤ 4. From a simple inspection of the ten cases in Figure 4 we can see that |E 0 | ∈ {1, 2, 3, 4}, |E 1 | = 0, and |E 2 | ∈ {0, 1, 2}. Thus, for i = 0, 1, 2 the following holds: Let G n be the subgraph of G n induced by C 0,2 , i.e., G n := D(C 0,2 ). Similarly, let It is easy to check that D 1 and G n satisfy the following properties: (i) the three sets forming D 1 are pairwise disjoint, (ii) no segment of D 1 belongs to G n , (iii) D 1 ⊆ D, and (iv) a and b are vertices of G n .
By applying the main result of [14] to G n we have that the connectivity of G n is at least where m = |C 0,2 |.
We are finally ready to prove Lemma 9.
Proof of Lemma 9. We analyze two cases separately, depending on whether a and b are located in Q n according to some case of Figure 3 or Figure 4.
Case 1. Suppose that a and b are located in Q n according to some case of Figure 3, and let H ⊆ G n be as in Section 4.2.1. From Proposition 11 and Hall's theorem it follows that H has a matching M of size m 1 := min{|A|, |B|}. Suppose that M = {a k b k | a k ∈ A, b k ∈ B, and k = 1, 2, . . . , m 1 }. Then is a collection a − b paths of G n of length 3. Furthermore, the paths in L are pairwise internally disjoint, because M is a matching of H. On the other hand, note that is also a collection of pairwise internally disjoint a − b paths of G n of length 2. Since D ∩ (A ∪ B) = ∅, then the paths in L ∪ L are pairwise internally disjoint. The existence of such m 1 + |D| paths, and (2) imply η(Q n ; a, b) = |D| + m 1 = |D| + min{|A|, |B|} = min{deg G n (a), deg G n (b)}.
Combining Proposition 2 and Theorem 3 we obtain that δ(G n ) = 7 18 n 2 + Θ(n). Since min{deg G n (a), deg G n (b)} ≥ δ(G n ), then (2) and (5) imply η(Q n ; a, b) = 7 18 n 2 + Θ(n) = 7 18 n 2 − Θ(n), as required. Case 2. Suppose now that a and b are located in Q n according to some case of Figure 4, and let G n , C i , D 1 , κ n , m, and Properties (i)-(iv) as in Section 4.2.2. Since 2 n 3 ≤ m ≤ 2 n 3 + 2, a straightforward manipulation on (4) gives that k n = 2 18 n 2 − Θ(n). This last equality, (iv), and Menger's theorem imply that G n has collection T of at least 2 18 n 2 − Θ(n) pairwise internally disjoint a − b paths. On the other hand, from (iii) it follows that T := adb | d ∈ D 1 , is a collection of |D 1 | pairwise internally disjoint a − b paths of G n of length 2. Moreover, by (ii) we have that T ∪ T is also a collection of pairwise internally disjoint a − b paths of G n . From (3), (i), and the definition of T , it is not hard to see that |T | = |D 1 | = |C 1 | 2 + |C 1 ||C 0 | + |C 1 ||C 2 | ≥ 5 18 n 2 − Θ(n).

Concluding Remarks
Let P be a set of n ≥ 3 points in general position in the plane. We have observed that the minimum degree δ(D(P)) of the disjointness graph of segments defined by P can be expressed in terms of n and the rectilinear local crossing number of the rectilinear drawing P of K n induced by P. From this observation and the exact value of lcr(K n ) provided by Theorem 1 in [19], it is easy to see that ( n 2 ) − lcr(K n ) is an upper bound for δ(D(P)), which is tight for each n. Since the connectivity κ(H) of a graph H is upper bounded by its minimum degree δ(H), then ( n 2 ) − lcr(K n ) is also a general upper bound for κ(D(P)). On the other hand, the main goal in this work is to estimate the connectivity of D(Q n ), where {Q n } ∞ n=3 is one of the families of point sets best understood from the point of view of rectilinear crossing number. In particular, it is known that Q n is almost 3-symmetric and that lcr(K n ) = lcr(Q n ) for each n ≡ 2 (mod 3). The basic idea behind our approach is to show that δ(D(Q n )) − κ(D(Q n )) cannot be too large. In fact, we strongly believe that δ(D(Q n )) = κ(D(Q n )) holds, and that this equality can be verified by analogous arguments to those used in Section 4.2.1. We finally remark that Theorem 1 is an asymptotic solution for an open question posed in [14].
Author Contributions: The authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.