Distinct distances in planar point sets with forbidden 4-point patterns
From MaRDI portal
Recommendations
Cites work
- A variant of the classical Ramsey problem
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Extremal problems in discrete geometry
- scientific article; zbMATH DE number 3897012 (Why is no real title available?)
- scientific article; zbMATH DE number 4083638 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3513795 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 2145241 (Why is no real title available?)
- scientific article; zbMATH DE number 861419 (Why is no real title available?)
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- More distinct distances under local conditions
- On distinct distances among points in general position and other related problems
- On Sets of Distances of n Points
- On some metric and combinatorial geometric problems
- On some problems of elementary and combinatorial geometry
- On the Erdős distinct distances problem in the plane
- Research Problems in Discrete Geometry
- The no-four-on-circle problem
- The probabilistic method
Cited in
(5)- The Distance 4-Sector of Two Points Is Unique
- Classification of seven-point four-distance sets in the plane
- Planar point sets with forbidden 4-point patterns and few distinct distances
- Classification of isosceles eight-point sets in three-dimensional Euclidean space
- On distinct distances and \(\lambda \)-free point sets
This page was built for publication: Distinct distances in planar point sets with forbidden 4-point patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776292)