Convex independent sets and 7-holes in restricted planar point sets

DOI10.1007/BF02187831zbMath0748.52005OpenAlexW2087585583MaRDI QIDQ1184157

Pavel Valtr

Publication date: 28 June 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131186

zbMATH Keywords

planar point setmaximal convex independent subsets

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

Cutting dense point sets in half ⋮ A Ramsey-Type Theorem in the Plane ⋮ Lines, line-point incidences and crossing families in dense sets ⋮ The visible perimeter of an arrangement of disks ⋮ A Note on the Number of General 4-holes in (Perturbed) Grids ⋮ Fixing a hole ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ Drawing graphs using a small number of obstacles ⋮ Point sets with small integer coordinates and no large convex polygons ⋮ Unnamed Item ⋮ 4-holes in point sets ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ Empty rainbow triangles in \(k\)-colored point sets ⋮ Sets in \(\mathbb{R}^ d\) with no large empty convex subsets ⋮ Holes in 2-convex point sets ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ On Erdős-Szekeres-type problems for \(k\)-convex point sets ⋮ A superlinear lower bound on the number of 5-holes ⋮ The Erdős-Szekeres Problem ⋮ The Erdos-Szekeres problem on points in convex position – a survey

Cites Work

• Konvexe Fünfecke in ebenen Punktmengen
• The maximum size of a convex polygon in a restricted set of points in the plane
• Sets with No Empty Convex 7-Gons
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex independent sets and 7-holes in restricted planar point sets