שחר סמורודינסקי
אקדמי בכיר
An improved bound for k-sets in three dimensions
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 [7] and [1]).
| שפת פרסום | אנגלית |
| דפים | 195-204 |
| כתב עת | Discrete and Computational Geometry |
| כרך | 26 |
| נושא מספר | 2 |
| סטטוס פרסום | פורסם - 01.01.2001 |
ASJC Scopus subject areas
Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
