Skip to main content

On Erdős–Szekeres-Type Problems for k-convex Point Sets

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2019)

Abstract

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 \in \mathbb {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 \(\varOmega (\log ^k{n})\). 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(\log {n})\). This gives a solution to a problem posed by Aichholzer et al. [2].

We prove that there is a constant \(c>0\) such that, for every \(n \in \mathbb {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\cdot \log {n}\) points from S contains a point of S in its interior. This matches an earlier upper bound by Aichholzer et al. [2] up to a multiplicative constant and answers another of their open problems.

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 (Charles University project UNCE/SCI/004). S. Bhore was supported by the Austrian Science Fund (FWF) under project number P31119. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We chose this name, since the set resembles Cantor function, which is also known under the name Devil’s staircase [16].

References

  1. Aichholzer, O., Aurenhammer, F., Demaine, E.D., Hurtado, F., Ramos, P., Urrutia, J.: On \(k\)-convex polygons. Comput. Geom. 45(3), 73–87 (2012)

    Article  MathSciNet  Google Scholar 

  2. Aichholzer, O., et al.: On \(k\)-convex point sets. Comput. Geom. 47(8), 809–832 (2014)

    Article  MathSciNet  Google Scholar 

  3. Aichholzer, O., et al.: Holes in 2-convex point sets. Comput. Geom. 74, 38–49 (2018)

    Article  MathSciNet  Google Scholar 

  4. Bárány, I., Valtr, P.: A positive fraction Erdős-Szekeres theorem. Discrete Comput. Geom. 19(3, Special Issue), 335–342 (1998)

    Article  MathSciNet  Google Scholar 

  5. Erdős, P.: Some more problems on elementary geometry. Austral. Math. Soc. Gaz. 5(2), 52–54 (1978)

    MathSciNet  MATH  Google Scholar 

  6. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)

    MathSciNet  MATH  Google Scholar 

  7. Erdős, P., Szekeres, G.: On some extremum problems in elementary geometry. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 3–4, 53–62 (1960/1961)

    Google Scholar 

  8. Gerken, T.: Empty convex hexagons in planar point sets. Discrete Comput. Geom. 39(1–3), 239–272 (2008)

    Article  MathSciNet  Google Scholar 

  9. Harborth, H.: Konvexe Fünfecke in ebenen Punktmengen. Elem. Math. 33(5), 116–118 (1978)

    MathSciNet  MATH  Google Scholar 

  10. Holmsen, A.F., Mojarrad, H.N., Pach, J., Tardos, G.: Two extensions of the Erdős-Szekeres problem. Preliminary version: http://arxiv.org/abs/1710.11415 (2017)

  11. Horton, J.D.: Sets with no empty convex \(7\)-gons. Canad. Math. Bull. 26(4), 482–484 (1983)

    Article  MathSciNet  Google Scholar 

  12. Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002). https://doi.org/10.1007/978-1-4613-0039-7

    Book  MATH  Google Scholar 

  13. Nicolás, C.M.: The empty hexagon theorem. Discrete Comput. Geom. 38(2), 389–397 (2007)

    Article  MathSciNet  Google Scholar 

  14. Pór, A., Valtr, P.: The partitioned version of the Erdős-Szekeres theorem. Discrete Comput. Geom. 28(4), 625–637 (2002)

    Article  MathSciNet  Google Scholar 

  15. Suk, A.: On the Erdős-Szekeres convex polygon problem. J. Am. Math. Soc. 30(4), 1047–1053 (2017)

    Article  Google Scholar 

  16. Thomson, B.S., Bruckner, J.B., Bruckner, A.M.: Elementary Real Analysis. Prentice-Hall, Upper Saddle River (2001)

    MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Paz Carmi for interesting discussions during the early stages of the research.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Balko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Balko, M., Bhore, S., Martínez Sandoval, L., Valtr, P. (2019). On Erdős–Szekeres-Type Problems for k-convex Point Sets. In: Colbourn, C., Grossi, R., Pisanti, N. (eds) Combinatorial Algorithms. IWOCA 2019. Lecture Notes in Computer Science(), vol 11638. Springer, Cham. https://doi.org/10.1007/978-3-030-25005-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-25005-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-25004-1

  • Online ISBN: 978-3-030-25005-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics