All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10403065" target="_blank" >RIV/00216208:11320/19:10403065 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-25005-8_4" target="_blank" >https://doi.org/10.1007/978-3-030-25005-8_4</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-25005-8_4" target="_blank" >10.1007/978-3-030-25005-8_4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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 ELEMENT OF 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 Ω(logk 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. We prove that there is a constant c &gt; 0 such that, for every n in 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 . log n points from S contains a point of S in its interior. This matches an earlier upper bound by Aichholzer et al. up to a multiplicative constant and answers another of their open problems.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/GA18-19158S" target="_blank" >GA18-19158S: Algorithmic, structural and complexity aspects of geometric and other configurations</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Combinatorial Algorithms

  • ISBN

    978-3-030-25004-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    35-47

  • Publisher name

    Springer, Cham

  • Place of publication

    Neuveden

  • Event location

    Itálie

  • Event date

    Jul 23, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article