Maximum planar sets that determine \(k\) distances (Q1126289)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 955149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum planar sets that determine \(k\) distances |
scientific article; zbMATH DE number 955149 |
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
0.8568132519721985
0 references
0.8499177694320679
0 references
