On some problems of elementary and combinatorial geometry
From MaRDI portal
Publication:1216631
DOI10.1007/BF02414146zbMATH Open0303.52006OpenAlexW1970934335MaRDI QIDQ1216631FDOQ1216631
Authors: P. Erdős 
Publication date: 1975
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02414146
Recommendations
Inequalities and extremum problems involving convexity in convex geometry (52A40) Problem books (00A07) Combinatorial inequalities (05A20) Length, area and volume in real or complex geometry (51M25)
Cites Work
Cited In (50)
- Two theorems on point-flat incidences
- The exact fitting problem in higher dimensions
- Bisectors and pinned distances
- Beck's theorem for plane curves
- Distinct distances in finite planar sets
- A lovely bunch of coconuts
- Title not available (Why is that?)
- Point sets with distinct distances
- The Erdos-Szekeres problem on points in convex position – a survey
- Some combinatorial problems in the plane
- A combinatorial distinction between the Euclidean and projective planes
- On the combinatorial problems which I would most like to see solved
- Title not available (Why is that?)
- Combinatorial complexity bounds for arrangements of curves and spheres
- The number of different distances determined by n points in the plane
- A survey of Sylvester's problem and its generalizations
- Two unsolved geometric problems
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- A note on distinct distances in rectangular lattices
- Bisector energy and few distinct distances
- Title not available (Why is that?)
- Many collinear \(k\)-tuples with no \(k+1\) collinear points
- On the structure of pointsets with many collinear triples
- Distinct distances between a collinear set and an arbitrary set of points
- The geometry of nesting problems: a tutorial
- Sets with many pairs of orthogonal vectors over finite fields
- Computational geometric aspects of rhythm, melody, and voice-leading
- On the pinned distances problem in positive characteristic
- The never-ending happiness of Paul Erdős's mathematics
- Geometria combinatoria e geometrie finite
- On convex holes in d-dimensional point sets
- Characterizing optimal point sets determining one distinct triangle
- Nineteen problems on elementary geometry
- Few distinct distances implies no heavy lines or circles
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
- Distinct distances in planar point sets with forbidden 4-point patterns
- Problems, problems, problems
- A bichromatic incidence bound and an application
- The chromatic number of the space \(( {\mathbb R}^n, l_1)\)
- On a question of Erdős and Ulam
- Title not available (Why is that?)
- On some problems of combinatorial geometry
- Quelques problèmes non résolus en géométrie plane. (Some unsolved problems in plane geometry)
- Every large point set contains many collinear points or an empty pentagon
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- The Mathematics of Ferran Hurtado: A Brief Survey
- Sets with few distinct distances do not have heavy lines
- Problems by the wayside
- Title not available (Why is that?)
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
This page was built for publication: On some problems of elementary and combinatorial geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216631)
