Paper Info
Title
On the number of k-subsets of a set of n points in the plane
Abstract
For a configuration S of n points in E2, H. Edelsbrunner (personal communication) has asked for bounds on the maximum number of subsets of size k cut off by a line. By generalizing to a combinatorial problem, we show that for 2k < n the number of such sets of size at most k is at most 2nk − 2k2 − k. By duality, the same bound applies to the number of cells at distance at most k from a base cell in the cell complex determined by an arrangement of n lines in P2.
Year
DOI
Venue
1984
10.1016/0097-3165(84)90081-5
Journal of Combinatorial Theory, Series A
Field
DocType
Volume
Discrete mathematics,Combinatorics,Generalization,Mathematics
Journal
36
Issue
ISSN
Citations 
1
0097-3165
21
PageRank 
References 
Authors
9.89
2
2
Name
Order
Citations
PageRank
Jacob E. Goodman1277136.42
Richard Pollack2912203.75