We prove that the maximum number of k-sets in a set S of n points in ℝ 3 is O(nk3/2). This improves substantially the previous best known upper bound of O(nk5/3) (see  and ).
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics