On Convex Polygons Determined by a Finite Planar Set
From MaRDI portal
Publication:4048164
DOI10.2307/2319566zbMath0295.52002OpenAlexW4234582906MaRDI QIDQ4048164
Publication date: 1974
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2319566
Related Items (9)
Nine convex sets determine a pentagon with convex sets as vertices ⋮ Convex drawings of the complete graph: topology meets geometry ⋮ Unnamed Item ⋮ Computer solution to the 17-point Erdős-Szekeres problem ⋮ Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points ⋮ On the existence of a point subset with 3 or 6 interior points ⋮ The Erdős-Szekeres Problem ⋮ More on an Erdős-Szekeres-type problem for interior points ⋮ The Erdos-Szekeres problem on points in convex position – a survey
This page was built for publication: On Convex Polygons Determined by a Finite Planar Set