Pages that link to "Item:Q1174151"
From MaRDI portal
The following pages link to A lower bound on the number of unit distances between the vertices of a convex polygon (Q1174151):
Displaying 15 items.
- Small distances in convex polygons (Q385726) (← links)
- On unit distances in a convex polygon (Q482205) (← links)
- On locally Gabriel geometric graphs (Q497339) (← links)
- Unit distances between vertices of a convex polygon (Q1199829) (← links)
- A postscript on distances in convex \(n\)-gons (Q1314446) (← links)
- The maximum number of unit distances in a convex \(n\)-gon (Q1813293) (← links)
- Multiplicities of interpoint distances in finite planar sets (Q1894357) (← links)
- Intervertex distances in convex polygons (Q1894358) (← links)
- On the number of occurrences of the \(k\)th smallest distance between points in convex position (Q2407030) (← links)
- On the chromatic number of subsets of the Euclidean plane (Q2441349) (← links)
- Lower bounds for the number of small convex \(k\)-holes (Q2444312) (← links)
- Turán problems for edge-ordered graphs (Q2692781) (← links)
- (Q3031546) (← links)
- Computational Geometry Column 34 (Q4513228) (← links)
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) (Q5937134) (← links)