Point sets with many k-sets

Abstract

For any n, k, n ≥ 2k > 0, we construct a set of n points in the plane with neΩ(√logk) k-sets. This improves the bounds of Erdos, Lovász, et al. As a consequence, we also improve the lower bound for the number of halving hyperplanes in higher dimensions.