scientific article; zbMATH DE number 3649571
From MaRDI portal
Publication:3207683
zbMATH Open0417.52002MaRDI QIDQ3207683FDOQ3207683
Authors: P. Erdős 
Publication date: 1978
Title of this publication is not available (Why is that?)
Recommendations
Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Problem books (00A07) Polytopes and polyhedra (52B99)
Cited In (50)
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)
- Empty rainbow triangles in \(k\)-colored point sets
- On the minimum number of mutually disjoint holes in planar point sets
- Two disjoint 5-holes in point sets
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- Drawing the Horton set in an integer grid of minimum size
- Empty triangles in good drawings of the complete graph
- The Erdos-Szekeres problem on points in convex position – a survey
- Title not available (Why is that?)
- Points defining triangles with distinct circumradii
- Empty squares in arbitrary orientation among points
- Almost empty monochromatic quadrilaterals in planar point sets
- Convex Polygons in Geometric Triangulations
- Almost empty monochromatic triangles in planar point sets
- On \(k\)-gons and \(k\)-holes in point sets
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- Disjoint empty convex pentagons in planar point sets
- Title not available (Why is that?)
- Faster counting empty convex polygons in a planar point set
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- Holes and islands in random point sets
- On disjoint holes in point sets
- Large convex holes in random point sets
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- On the Erdős–Szekeres problem in combinatorial geometry
- Tight bounds on the expected number of holes in random point sets
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- The Erdős-Szekeres Problem
- On Erdős-Szekeres-type problems
- Erdős-Szekeres-type problems in the real projective plane
- On \(k\)-convex point sets
- A superlinear lower bound on the number of 5-holes
- Convex polygons in geometric triangulations
- On balanced 4-holes in bichromatic point sets
- Fixing a hole
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- Nineteen problems on elementary geometry
- Point sets with small integer coordinates and no large convex polygons
- Blocking the \(k\)-holes of point sets in the plane
- Drawing the almost convex set in an integer grid of minimum size
- Almost empty hexagons
- Empty convex hexagons in planar point sets
- On geometric graphs on point sets in the plane
- Convex polygons in Cartesian products
- Title not available (Why is that?)
- Holes in 2-convex point sets
- On the number of edges in geometric graphs without empty triangles
- On Erdős-Szekeres-type problems for \(k\)-convex point sets
- On pseudo-convex partitions of a planar point set
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3207683)
