The maximum number of unit distances in a convex n-gon

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

It is proved that the number defined in the title is at most O(n log n).

Original languageEnglish
Pages (from-to)316-320
Number of pages5
JournalJournal of Combinatorial Theory, Series A
Volume55
Issue number2
DOIs
Publication statusPublished - Nov 1990

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'The maximum number of unit distances in a convex n-gon'. Together they form a unique fingerprint.

  • Cite this