Maximum planar sets that determine k distances

P. Erdős, Peter Fishburn

Research output: Contribution to journalArticle

14 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
Publication statusPublished - Nov 15 1996

Fingerprint

Triangular Lattice
Subset
Evidence

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Maximum planar sets that determine k distances. / Erdős, P.; Fishburn, Peter.

In: Discrete Mathematics, Vol. 160, No. 1-3, 15.11.1996, p. 115-125.

Research output: Contribution to journalArticle

Erdős, P & Fishburn, P 1996, 'Maximum planar sets that determine k distances', Discrete Mathematics, vol. 160, no. 1-3, pp. 115-125.
Erdős, P. ; Fishburn, Peter. / Maximum planar sets that determine k distances. In: Discrete Mathematics. 1996 ; Vol. 160, No. 1-3. pp. 115-125.
@article{27e12a0e728e41fb9e56f4489499317c,
title = "Maximum planar sets that determine k distances",
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.",
author = "P. Erdős and Peter Fishburn",
year = "1996",
month = "11",
day = "15",
language = "English",
volume = "160",
pages = "115--125",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Maximum planar sets that determine k distances

AU - Erdős, P.

AU - Fishburn, Peter

PY - 1996/11/15

Y1 - 1996/11/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0039770838&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039770838&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0039770838

VL - 160

SP - 115

EP - 125

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -