Results 1  10
of
11
On ksets, convex quadrilaterals, and the rectilinear crossing number of K_n
 of Kn, Discr. Comput. Geom
, 2004
"... 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 #(S) of convex quadrilaterals determined by the points in S is at leas ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
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 #(S) of convex quadrilaterals determined by the points in S is at least 0.37533 ). This in turn implies that the rectilinear crossing number cr(Kn ) of the complete graph Kn is at least 0.37533 ), and that Sylvester's Four Point Problem Constant is at least 0.37533. These improved bounds refine results recently obtained by Abrego and FernandezMerchant, and by Lovasz, Vesztergombi, Wagner and Welzl.
On the Rectilinear Crossing Number of Complete Graphs
 Proc. 14th ACMSIAM Sympos. Discr. Alg
, 2003
"... We prove a lower bound of 0:3288 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 pa ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We prove a lower bound of 0:3288 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.
On (≤ k)pseudoedges in generalized configurations and the pseudolinear crossing number of K_n
, 2006
"... It is known that every generalized configuration with n points has at least 3 ` k+2 2 ´ ( ≤ k)–pseudoedges, and that this bound is tight for k ≤ n/3 − 1. Here we show that this bound is no longer tight for (any) k> n/3 − 1. As a corollary, we prove that the usual and the pseudolinear (and hence t ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
It is known that every generalized configuration with n points has at least 3 ` k+2 2 ´ ( ≤ k)–pseudoedges, and that this bound is tight for k ≤ n/3 − 1. Here we show that this bound is no longer tight for (any) k> n/3 − 1. As a corollary, we prove that the usual and the pseudolinear (and hence the rectilinear) crossing numbers of the complete graph Kn are different for every n ≥ 10. It has been noted that all known optimal rectilinear drawings of Kn share a triangular–like property, which we abstract into the concept of 3–decomposability. We give a lower bound for the crossing numbers of all pseudolinear drawings of Kn that satisfy this property. This bound coincides with the best general lower bound known for the rectilinear crossing number of Kn, established recently in a groundbreaking work by Aichholzer, García, Orden, and Ramos. We finally use these results to calculate the pseudolinear (which happen to coincide with the rectilinear) crossing numbers of Kn for n ≤ 12 and n = 15.
The maximum number of halving lines and the rectilinear crossing number of Kn for n ≤ 27
, 2007
"... For n ≤ 27 we present exact values for the maximum number h(n) of halving lines and eh(n) of halving pseudolines, determined by n points in the plane. For this range of values of n we also present exact values of the rectilinear cr(n) and the pseudolinear ecr(n) crossing number of the complete ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
For n ≤ 27 we present exact values for the maximum number h(n) of halving lines and eh(n) of halving pseudolines, determined by n points in the plane. For this range of values of n we also present exact values of the rectilinear cr(n) and the pseudolinear ecr(n) crossing number of the complete
THE RECTILINEAR CROSSING NUMBER OF Kn: CLOSING IN (OR ARE WE?)
"... Abstract. The calculation of the rectilinear crossing number of complete graphs is an important open problem in combinatorial geometry, with important and fruitful connections to other classical problems. Our aim in this work is to survey the body of knowledge around this parameter. 1. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The calculation of the rectilinear crossing number of complete graphs is an important open problem in combinatorial geometry, with important and fruitful connections to other classical problems. Our aim in this work is to survey the body of knowledge around this parameter. 1.
Abstract On the Rectilinear Crossing Number of Complete Graphs
"... We prove a lower bound of 0.3288 n 4¡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 i ..."
Abstract
 Add to MetaCart
We prove a lower bound of 0.3288 n 4¡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. 1