Nine convex sets determine a pentagon with convex sets as vertices

DOI10.1007/BF00184161zbMath0677.52003MaRDI QIDQ1123407

S. H. Smith

Publication date: 1989

Published in: Geometriae Dedicata (Search for Journal in Brave)

zbMATH Keywords

Erdős-Szekeres problemconvex sets in the plane

Mathematics Subject Classification ID

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

Related Items (4)

Convexly independent sets ⋮ Two extensions of the Erdős-Szekeres problem ⋮ The Erdos-Szekeres problem on points in convex position – a survey ⋮ THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS

Cites Work

• A generalization of the Erdös-Szekeres convex n-gon theorem.
• On Convex Polygons Determined by a Finite Planar Set
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nine convex sets determine a pentagon with convex sets as vertices