Isosceles triangles determined by a planar point set

DOI10.1007/s003730200063zbMath1018.52013OpenAlexW2074825559MaRDI QIDQ1865634

János Pach, Gábor Tardos

Publication date: 27 March 2003

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

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

zbMATH Keywords

isosceles trianglessmallest number of distinct distances

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (12)

Bisector energy and few distinct distances ⋮ On distinct perpendicular bisectors and pinned distances in finite fields ⋮ On distinct sums and distinct distances. ⋮ A note on distinct distance subsets ⋮ On discrete values of bilinear forms ⋮ Incidences between points and generalized spheres over finite fields and related problems ⋮ A bipartite strengthening of the crossing Lemma ⋮ Crossing numbers of imbalanced graphs ⋮ On distinct distances and \(\lambda \)-free point sets ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ On distinct distances among points in general position and other related problems

This page was built for publication: Isosceles triangles determined by a planar point set