### 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 language | English |
---|---|

Pages (from-to) | 115-125 |

Number of pages | 11 |

Journal | Discrete Mathematics |

Volume | 160 |

Issue number | 1-3 |

Publication status | Published - Nov 15 1996 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*160*(1-3), 115-125.

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

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 160, no. 1-3, pp. 115-125.

}

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 -