--- res: bibo_abstract: - We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadrilaterals in any set of n points in general position in the Euclidean plane. As we see it, the main contribution of this paper is not so much the concrete numerical improvement over earlier bounds, as the novel method of proof, which is not based on bounding cr̄(Kn) for some small n.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Uli foaf_name: Uli Wagner foaf_surname: Wagner foaf_workInfoHomepage: http://www.librecat.org/personId=36690CA2-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-1494-0568 dct_date: 2003^xs_gYear dct_publisher: SIAM@ dct_title: On the rectilinear crossing number of complete graphs@ ...