Repeated distances in space

DOI10.1007/BF01864161zbMath0656.05039OpenAlexW2128872143WikidataQ105659535 ScholiaQ105659535MaRDI QIDQ1109785

János Pach, David Avis, Paul Erdős

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01864161

zbMATH Keywords

furthest neighbor graphrepeated distance graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs, Furthest neighbours in space, The exact fitting problem in higher dimensions, Favourite distances in \(3\)-space, Large simplices determined by finite point sets, Combinatorial complexity bounds for arrangements of curves and spheres, Variations on the theme of repeated distances, Popular distances in 3-space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Research Problems in Discrete Geometry
• The Number of Furthest Neighbour Pairs of a Finite Planar Set