A lower bound on the number of unit distances between the vertices of a convex polygon
From MaRDI portal
(Redirected from Publication:1174151)
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.
Recommendations
Cites work
Cited in
(22)- Unit distances between vertices of a convex polygon
- A postscript on distances in convex \(n\)-gons
- The maximum number of unit distances in a convex n-gon
- The unit distance problem for centrally symmetric convex polygons
- Multiplicities of interpoint distances in finite planar sets
- Intervertex distances in convex polygons
- On the number of occurrences of the \(k\)th smallest distance between points in convex position
- On the chromatic number of subsets of the Euclidean plane
- Lower bounds for the number of small convex \(k\)-holes
- Turán problems for edge-ordered graphs
- The number of distinct distances from a vertex of a convex polygon
- scientific article; zbMATH DE number 4129534 (Why is no real title available?)
- The Sum of Distances Between Vertices of a Convex Polygon with Unit Perimeter
- Small distances in convex polygons
- Computational Geometry Column 34
- On unit distances in a convex polygon
- A convex polygon with small sum of squared distances between its vertices
- scientific article; zbMATH DE number 1440118 (Why is no real title available?)
- On locally Gabriel geometric graphs
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
- Unit and distinct distances in typical norms
- On distinct distances from a vertex of a convex polygon
This page was built for publication: A lower bound on the number of unit distances between the vertices of a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174151)
