A lower bound on the number of unit distances between the vertices of a convex polygon (Q1174151)
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: A lower bound on the number of unit distances between the vertices of a convex polygon |
scientific article; zbMATH DE number 8162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the number of unit distances between the vertices of a convex polygon |
scientific article; zbMATH DE number 8162 |
Statements
A lower bound on the number of unit distances between the vertices of a convex polygon (English)
0 references
25 June 1992
0 references
The authors prove that to every \(n\geq 4\) there exists a convex \(n\)-gon such that at least \(2n-7\) of its vertex pairs are of unit mutual distance. This improves for \(n\geq 17\) a result by P. Erdős and L. Moser.
0 references
number of unit distances
0 references
vertices
0 references
convex polygon
0 references
0.8992806077003479
0 references
0.8755168914794922
0 references
0.8346510529518127
0 references
0.833633542060852
0 references
