The maximum number of times the same distance can occur among the vertices of a convex n-gon is o(n log n)

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a short proof of Z. Füredi’s theorem (1990, J. Combin. Theory Ser. A55, 316-320) stated in the title. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Braß, P., & Pach, J. (2001). The maximum number of times the same distance can occur among the vertices of a convex n-gon is o(n log n). Journal of Combinatorial Theory. Series A. https://doi.org/10.1006/jcta.2000.3133

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free