A note on the 2-colored rectilinear crossing number of random point sets in the unit square (Q6607771)

The authors' work extends that of Sylvester's Four Point Problem of 1868: Let \(R\) be a closed bounded convex set in the plane, and compute the probability that four points chosen uniformly at random from \(R\) form the vertices of a convex quadrilateral.\par In this paper, the authors consider the case when the vertices of a complete geometric graph \(D\) are chosen at random from the unit square \([0,1] \times [0,1]\). The following theorem is proven:\par Let \(S\) be a set of four points chosen independently and uniformly at random from the unit square. Join every pair of points of \(S\) with a straight line segment. Color each such edge red if it has positive slope and blue otherwise. Then the probability that \(S\) defines a pair of crossing edges of the same color is equal to \(1/4\).