Maximum planar sets that determine k distances

Paul Erdos, Peter Fishburn

Research output: Article

15 Citations (Scopus)

Abstract

Maximum planar sets that determine k distances are identified for k ≤ 5. Evidence is presented for the conjecture that all maximum sets for k ≥ 7 are subsets of the triangular lattice.

Original languageEnglish
Pages (from-to)115-125
Number of pages11
JournalDiscrete Mathematics
Volume160
Issue number1-3
DOIs
Publication statusPublished - nov. 15 1996

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this