Maximum planar sets that determine \(k\) distances (Q1126289): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dm/ErdosF96, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dm/ErdosF96 / rank | |||
Normal rank | |||
Latest revision as of 08:50, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum planar sets that determine \(k\) distances |
scientific article |
Statements
Maximum planar sets that determine \(k\) distances (English)
0 references
21 August 1997
0 references
The authors identify subsets of points in the plane with the property that there are \(k\) interpoint distances and have as many points as possible. They do this for \(k\leq 5\). They conjecture that such maximal point set for \(k\geq 7\) must be subsets of the triangular lattice.
0 references
extremal sets of points
0 references
point configurations
0 references
extremal problems
0 references
distances in graph
0 references
