Repeated distances in space
From MaRDI portal
DOI10.1007/BF01864161zbMATH Open0656.05039OpenAlexW2128872143WikidataQ105659535 ScholiaQ105659535MaRDI QIDQ1109785FDOQ1109785
Authors: David Avis, János Pach, P. 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- Research Problems in Discrete Geometry
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Number of Furthest Neighbour Pairs of a Finite Planar Set
Cited In (9)
- The exact fitting problem in higher dimensions
- ENUMERATING INTERDISTANCES IN SPACE
- Combinatorial complexity bounds for arrangements of curves and spheres
- Popular distances in 3-space
- Furthest neighbours in space
- Favourite distances in \(3\)-space
- Large simplices determined by finite point sets
- Variations on the theme of repeated distances
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
This page was built for publication: Repeated distances in space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109785)