The following pages link to On Sets of Distances of n Points (Q5836902):
Displaying 50 items.
- Erdős type problems in modules over cyclic rings (Q276068) (← links)
- On the geometric structures with \(n\) points and \(k\) distances (Q277489) (← links)
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- Bisector energy and few distinct distances (Q312146) (← links)
- Subtended angles (Q312334) (← links)
- Areas of triangles and Beck's theorem in planes over finite fields (Q313454) (← links)
- Turán type results for distance graphs (Q331389) (← links)
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- New bounds for the distance Ramsey number (Q393923) (← links)
- Tangencies between families of disjoint regions in the plane (Q427060) (← links)
- The generalized Erdős-Falconer distance problems in vector spaces over finite fields (Q452378) (← links)
- On unit distances in a convex polygon (Q482205) (← links)
- Drawing outerplanar graphs using three edge lengths (Q482350) (← links)
- On the Erdős distinct distances problem in the plane (Q482909) (← links)
- On locally Gabriel geometric graphs (Q497339) (← links)
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641) (← links)
- On the number of similar instances of a pattern in a finite set (Q504974) (← links)
- The achromatic number of Kneser graphs (Q510596) (← links)
- Ball polytopes and the Vázsonyi problem (Q624221) (← links)
- The number of unit distances is almost linear for most norms (Q624331) (← links)
- The small hexagon and heptagon with maximum sum of distances between vertices (Q628747) (← links)
- Minimum planar sets with maximum equidistance counts (Q676063) (← links)
- The grid revisited (Q686463) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- A note on distinct distances in rectangular lattices (Q740655) (← links)
- Diameter graphs in \({\mathbb R}^4\) (Q741607) (← links)
- Double-normal pairs in the plane and on the sphere (Q747563) (← links)
- Variations on the theme of repeated distances (Q756139) (← links)
- Distinct distances in planar point sets with forbidden 4-point patterns (Q776292) (← links)
- The symmetric all-furthest-neighbor problem (Q789727) (← links)
- The number of different distances determined by n points in the plane (Q791525) (← links)
- Unit distances (Q801059) (← links)
- Finding squares and rectangles in sets of points (Q802873) (← links)
- Distinct distances with \(\ell_p\) metrics (Q824324) (← links)
- On the maximum number of translates in a point set (Q848857) (← links)
- On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
- On Falconer's distance set conjecture (Q879632) (← links)
- On the Minkowski distances and products of sum sets (Q891173) (← links)
- Sets with many pairs of orthogonal vectors over finite fields (Q897331) (← links)
- Remarks on Schur's conjecture (Q899710) (← links)
- On the graph of large distances (Q908937) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- A new proof of Vázsonyi's conjecture (Q942175) (← links)
- Near optimal bounds for the Erdős distinct distances problem in high dimensions (Q949786) (← links)
- Planar unit-distance graphs having planar unit-distance complement (Q952659) (← links)
- A note on the number of different inner products generated by a finite set of vectors (Q966051) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
