Forced convex \(n\)-gons in the plane

DOI10.1007/PL00009353zbMath0908.52004OpenAlexW1973130400WikidataQ54152678 ScholiaQ54152678MaRDI QIDQ1387846

Fan R. K. Chung, Ronald L. Graham

Publication date: 8 June 1998

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

Full work available at URL: https://doi.org/10.1007/pl00009353

zbMATH Keywords

vertexconvex \(n\)-gon

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

On the Erdős-Szekeres convex polygon problem, An improved upper bound for the Erdős-Szekeres conjecture, Erdős-Szekeres without induction, On the Erdös-Szekeres problem, Two upper bounds for the Erdős-Szekeres number with conditions, On the minimum number of mutually disjoint holes in planar point sets, Point sets with small integer coordinates and no large convex polygons, Computer solution to the 17-point Erdős-Szekeres problem, A SAT attack on the Erdős-Szekeres conjecture, Ramsey-remainder for convex sets and the Erdős-Szekeres theorem, Disjoint empty convex polygons in planar point sets, On the Erdős-Szekeres \(n\)-interior-point problem, Erdős-Szekeres theorem for lines, The Erdős-Szekeres Problem, The Erdos-Szekeres problem on points in convex position – a survey