Pages that link to "Item:Q1216631"
From MaRDI portal
The following pages link to On some problems of elementary and combinatorial geometry (Q1216631):
Displaying 35 items.
- Bisector energy and few distinct distances (Q312146) (← links)
- Many collinear \(k\)-tuples with no \(k+1\) collinear points (Q377492) (← links)
- A bichromatic incidence bound and an application (Q650111) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- A note on distinct distances in rectangular lattices (Q740655) (← links)
- Distinct distances in planar point sets with forbidden 4-point patterns (Q776292) (← links)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry (Q789732) (← links)
- The number of different distances determined by n points in the plane (Q791525) (← links)
- A combinatorial distinction between the Euclidean and projective planes (Q793745) (← links)
- Two theorems on point-flat incidences (Q827305) (← links)
- On a question of Erdős and Ulam (Q848677) (← links)
- Sets with many pairs of orthogonal vectors over finite fields (Q897331) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs (Q1113458) (← links)
- Some combinatorial problems in the plane (Q1133547) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Distinct distances in finite planar sets (Q1377750) (← links)
- Few distinct distances implies no heavy lines or circles (Q1701352) (← links)
- Point sets with distinct distances (Q1900187) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- Bisectors and pinned distances (Q2207607) (← links)
- Beck's theorem for plane curves (Q2223446) (← links)
- Characterizing optimal point sets determining one distinct triangle (Q2299408) (← links)
- Sets with few distinct distances do not have heavy lines (Q2342638) (← links)
- Distinct distances between a collinear set and an arbitrary set of points (Q2411627) (← links)
- A survey of Sylvester's problem and its generalizations (Q2638534) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- Geometria combinatoria e geometrie finite (Q3218706) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- The chromatic number of the space $( {\mathbb R}^n, l_1)$ (Q4645149) (← links)
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets (Q5302743) (← links)
- On convex holes in <i>d</i>-dimensional point sets (Q5886309) (← links)
- On the pinned distances problem in positive characteristic (Q6133808) (← links)