Maximum planar sets that determine \(k\) distances (Q1126289): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On A Problem of P. Erdos / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of different distances determined by a set of points in the Euclidean plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Sets of Distances of n Points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex nonagons with five intervertex distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex polygons with few intervertex distances / rank | |||
Normal rank | |||
Revision as of 15:11, 24 May 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
