Name
Abstract | ||
|---|---|---|
Abstract. One of our results: Let X be a nite set on the plane, 0 < " < 1.Then there exists a set F (a weak "-net) of size at most 7=", such that every convex set containing at least "jXj elements of X intersects F. Note that the size of F is independent of the size of X. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1017/S0963548300000225 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
convex hull,convex set | Orthogonal convex hull,Absolutely convex set,Discrete mathematics,Combinatorics,Convex hull,Convex set,Subderivative,Convex polytope,Choquet theory,Convex analysis,Mathematics | Journal |
Volume | Issue | Citations |
1 | 03 | 44 |
PageRank | References | Authors |
5.74 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| Imre Bárány | 2 | 435 | 95.10 |
| Zoltán Füredi | 3 | 1237 | 233.60 |
| Daniel J. Kleitman | 4 | 854 | 277.98 |