Convex Quadrilaterals and k-Sets

@inproceedings{Lovsz2003ConvexQA,
  title={Convex Quadrilaterals and k-Sets},
  author={L{\'a}szl{\'o} Lov{\'a}sz and Katalin Vesztergombi and Uli Wagner and Emo Welzl},
  year={2003}
}
We prove that the minimum number of convex quadrilaterals determined by n points in general position in the plane – or in other words, the rectilinear crossing number of the complete graph Kn – is at least (8 + 10 −5) (n 4 ) + O(n3). This is closely related to the rectilinear crossing number of complete graphs and to Sylvester’s Four Point Problem from the theory of geometric probabilities. As our main tool, we prove a lower bound on the number of (≤ k)-sets of the point set: for every k ≤ n/2… CONTINUE READING

From This Paper

Topics from this paper.
45 Citations
23 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 23 references

An upper bound for the rectilinear crossing number of the complete graph

  • H. F. Jensen
  • J. Combin. Theory Ser. B
  • 1971
Highly Influential
2 Excerpts

Rectilinear crossing numbers. Manuscript (1971), available at http://www.cwru.edu/artsci/math/singer/home.html

  • David Singer
  • 1971
Highly Influential
3 Excerpts

Rectilinear crossing numbers Joel Spencer and Géza Tóth . Crossing numbers of random graphs

  • Géza Tóth
  • 2002

Similar Papers

Loading similar papers…