Nearly equal distances and Szemerédi's regularity lemma
From MaRDI portal
Publication:2489544
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 17642 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1943971 (Why is no real title available?)
- scientific article; zbMATH DE number 2145241 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 3893918 (Why is no real title available?)
- Combinatorial complexity bounds for arrangements of curves and spheres
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Crossing patterns of semi-algebraic sets
- Cutting circles into pseudo-segments and improved bounds for incidences
- Nearly Equal Distances in the Plane
- On Sets of Distances of n Points
- Research Problems in Discrete Geometry
Cited in
(3)
This page was built for publication: Nearly equal distances and Szemerédi's regularity lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489544)