TY - JOUR

T1 - On Erdős–Szekeres-type problems for k-convex point sets

AU - Balko, Martin

AU - Bhore, Sujoy

AU - Martínez-Sandoval, Leonardo

AU - Valtr, Pavel

N1 - Funding Information:
The project leading to this application has received funding from European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under Grant Agreement No. 678765. M. Balko and P. Valtr were supported by the Grant No. 18-19158S of the Czech Science Foundation (GAČR). M. Balko and L. Martínez-Sandoval were supported by the grant 1452/15 from Israel Science Foundation. M. Balko was supported by Center for Foundations of Modern Computer Science, Czech Republic (Charles University project UNCE/SCI/004). L. Martínez Sandoval was supported by the grant ANR-17-CE40-0018 of the French National Research Agency ANR (project CAPPS). This research was supported by the PRIMUS/17/SCI/3 project of Charles University, Czech Republic . An extended abstract of this paper will appear in the Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019)
Funding Information:
The project leading to this application has received funding from European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under Grant Agreement No. 678765. M. Balko and P. Valtr were supported by the Grant No. 18-19158S of the Czech Science Foundation (GAČR) . M. Balko and L. Martínez-Sandoval were supported by the grant 1452/15 from Israel Science Foundation . M. Balko was supported by Center for Foundations of Modern Computer Science, Czech Republic (Charles University project UNCE/SCI/004 ). L. Martínez Sandoval was supported by the grant ANR-17-CE40-0018 of the French National Research Agency ANR (project CAPPS). This research was supported by the PRIMUS/17/SCI/3 project of Charles University, Czech Republic . An extended abstract of this paper will appear in the Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019)
Publisher Copyright:
© 2020 Elsevier Ltd

PY - 2020/10/1

Y1 - 2020/10/1

N2 - We study Erdős–Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning simple polygonization of S such that the intersection of any straight line with its interior consists of at most k connected components. We address several open problems about k-convex point sets. In particular, we extend the well-known Erdős–Szekeres Theorem by showing that, for every fixed k∈N, every set of n points in the plane in general position (with no three collinear points) contains a k-convex subset of size at least Ω(logkn). We also show that there are arbitrarily large 3-convex sets of n points in the plane in general position whose largest 1-convex subset has size O(logn). This gives a solution to a problem posed by Aichholzer et al. (2014). We prove that there is a constant c>0 such that, for every n∈N, there is a set S of n points in the plane in general position such that every 2-convex polygon spanned by at least c⋅logn points from S contains a point of S in its interior. This matches an earlier upper bound by Aichholzer et al. (2014) up to a multiplicative constant and answers another of their open problems.

AB - We study Erdős–Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning simple polygonization of S such that the intersection of any straight line with its interior consists of at most k connected components. We address several open problems about k-convex point sets. In particular, we extend the well-known Erdős–Szekeres Theorem by showing that, for every fixed k∈N, every set of n points in the plane in general position (with no three collinear points) contains a k-convex subset of size at least Ω(logkn). We also show that there are arbitrarily large 3-convex sets of n points in the plane in general position whose largest 1-convex subset has size O(logn). This gives a solution to a problem posed by Aichholzer et al. (2014). We prove that there is a constant c>0 such that, for every n∈N, there is a set S of n points in the plane in general position such that every 2-convex polygon spanned by at least c⋅logn points from S contains a point of S in its interior. This matches an earlier upper bound by Aichholzer et al. (2014) up to a multiplicative constant and answers another of their open problems.

UR - http://www.scopus.com/inward/record.url?scp=85085320484&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2020.103157

DO - 10.1016/j.ejc.2020.103157

M3 - Article

AN - SCOPUS:85085320484

SN - 0195-6698

VL - 89

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103157

ER -