Abstract | ||
---|---|---|
For any n , k , n\geq 2k>0 , we construct a set of n points in the plane with $ne^{\Omega({\sqrt{\log k}})}$ k -sets. This improves the bounds of Erd s, Lovász, et al. As a consequence, we also improve the lower bound for the number of halving hyperplanes in higher dimensions. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1007/s004540010022 | Discrete & Computational Geometry |
DocType | Volume | Issue |
Journal | 26 | 2 |
ISSN | ISBN | Citations |
0179-5376 | 1-58113-224-7 | 53 |
PageRank | References | Authors |
3.26 | 16 | 1 |