Isosceles triangles determined by a planar point set

DOI10.1007/S003730200063zbMATH Open1018.52013OpenAlexW2074825559MaRDI QIDQ1865634FDOQ1865634

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)

Cited In (14)

• Crossing numbers of imbalanced graphs
• A bipartite strengthening of the crossing Lemma
• On distinct distances and \(\lambda \)-free point sets
• A note on distinct distance subsets
• On distinct distances among points in general position and other related problems
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• A Bipartite Strengthening of the Crossing Lemma
• Bisector energy and few distinct distances
• On distinct perpendicular bisectors and pinned distances in finite fields
• Title not available (Why is that?)
• On discrete values of bilinear forms
• On distinct sums and distinct distances.
• The number of isosceles right triangles determined by \(n\) points in convex position in the plane
• Incidences between points and generalized spheres over finite fields and related problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865634)