scientific article
From MaRDI portal
Publication:3207683
zbMath0417.52002MaRDI QIDQ3207683
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problem books (00A07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52B99)
Related Items
Drawing the Horton set in an integer grid of minimum size ⋮ Two disjoint 5-holes in point sets ⋮ Almost empty monochromatic triangles in planar point sets ⋮ Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ On the number of edges in geometric graphs without empty triangles ⋮ Drawing the almost convex set in an integer grid of minimum size ⋮ On pseudo-convex partitions of a planar point set ⋮ Holes and islands in random point sets ⋮ Tight bounds on the expected number of holes in random point sets ⋮ On the Erdős–Szekeres problem in combinatorial geometry ⋮ Fixing a hole ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Large convex holes in random point sets ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ On geometric graphs on point sets in the plane ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ Empty squares in arbitrary orientation among points ⋮ Lower bounds for the number of small convex \(k\)-holes ⋮ Unnamed Item ⋮ 4-holes in point sets ⋮ Almost empty hexagons ⋮ On balanced 4-holes in bichromatic point sets ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ Empty rainbow triangles in \(k\)-colored point sets ⋮ A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) ⋮ On \(k\)-convex point sets ⋮ Disjoint empty convex pentagons in planar point sets ⋮ Empty convex hexagons in planar point sets ⋮ Holes in 2-convex point sets ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ On Erdős-Szekeres-type problems for \(k\)-convex point sets ⋮ On the minimum size of a point set containing a 5-hole and double disjoint 3-holes ⋮ A superlinear lower bound on the number of 5-holes ⋮ Convex polygons in Cartesian products ⋮ Faster counting empty convex polygons in a planar point set ⋮ The Erdős-Szekeres Problem ⋮ On Erdős-Szekeres-type problems ⋮ Points defining triangles with distinct circumradii ⋮ The Erdos-Szekeres problem on points in convex position – a survey ⋮ Empty triangles in good drawings of the complete graph
This page was built for publication:
