Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"orchard problem"”.
-
Problems and Results in Discrete and Computational Geometry
… by n points is at least 1 + binom(n-1,3) - t^{orchard}_{3} (n-1), and this bound is best possible under its hypothesis. (Byt^{orchard}_{3} , we are denoting the maximum number of three-point lines attainableby a configuration of n points, no four collinear, in the plane, i.e., the …