Increasing the minimum distance of a set of points (Q1072551)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Increasing the minimum distance of a set of points |
scientific article; zbMATH DE number 3941541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Increasing the minimum distance of a set of points |
scientific article; zbMATH DE number 3941541 |
Statements
Increasing the minimum distance of a set of points (English)
0 references
1985
0 references
Given \(n\) points in \(E^k\) with minimum distance 1, \(f(n,k)\) denotes the largest number of points (among the \(n\)) which have minimum distance \(>1\). Here is a very short proof that \(f(n,2)>n/4\).
0 references
plane
0 references
configuration of points
0 references
minimum distance
0 references
