Crossing Patterns of Segments

It is shown that for every c>0 there exists c′>0 satisfying the following condition. Let S be a system of n straight-line segments in the plane, which determine at least cn2 crossings. Then there are two disjoint at least c′n-element subsystems, S1, S2⊂S, such that every element of S1 crosses all elements of S2.