Nearly equal distances and Szemerédi's regularity lemma
From MaRDI portal
Publication:2489544
DOI10.1016/J.COMGEO.2005.06.002zbMATH Open1096.52009OpenAlexW2056452648WikidataQ124816404 ScholiaQ124816404MaRDI QIDQ2489544FDOQ2489544
Authors: János Pach, Radoš Radoičić, Jan Vondrák
Publication date: 28 April 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.06.002
Recommendations
Cites Work
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- Crossing patterns of semi-algebraic sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Title not available (Why is that?)
- On Sets of Distances of n Points
- Combinatorial complexity bounds for arrangements of curves and spheres
- Cutting circles into pseudo-segments and improved bounds for incidences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearly Equal Distances in the Plane
- Title not available (Why is that?)
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)