25 research outputs found
Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K_n
We use circular sequences to give an improved lower bound on the minimum number of (<=k)-sets in a set of points in general position. We then use this to show that if S is a set of n points in general position, then the number of convex quadrilaterals determined by the points in S is at least . This in turn implies that the rectilinear crossing number of the complete graph K_n is at least . These improved bounds refine results recently obtained by Ábrego and Fernández-Merchant, and by Lovász, Vesztergombi, Wagner and Welzl