Abstract
We prove that the maximum number of dots in ann×n array of dots with distinct slopes is at leastcn 2/3(logn)−1/3 withc>0. This improves a previous result ofcn 1/2. An upper bound isO(n 4/5).
This is a preview of subscription content, log in via an institution to check access.
References
Paul Erdős, Ron L. Graham, Imre Z. Ruzsa andHerbert Taylor: Bounds for Arrays of Dots with Distinct Slopes or Length,Combinatorica 12 (1992), 39–44.
Author information
Authors and Affiliations
Additional information
This research is supported in part by NSF under the grant NCR-8905052.
Rights and permissions
About this article
Cite this article
Zhang, Z. A note on arrays of dots with distinct slopes. Combinatorica 13, 127–128 (1993). https://doi.org/10.1007/BF01202795
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01202795