Number of the records: 1  

Non-homotopic Loops with a Bounded Number of Pairwise Intersections

  1. 1.
    SYSNO ASEP0551784
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleNon-homotopic Loops with a Bounded Number of Pairwise Intersections
    Author(s) Blažej, V. (CZ)
    Opler, M. (CZ)
    Šileikis, Matas (UIVT-O) RID, ORCID, SAI
    Valtr, P. (CZ)
    Number of authors4
    Source TitleGraph Drawing and Network Visualization. 29th International Symposium GD 2021, Revised Selected Papers. - Cham : Springer, 2021 / Purchase H. C. ; Rutter I. - ISSN 0302-9743 - ISBN 978-3-030-92930-5
    Pagess. 210-222
    Number of pages13 s.
    Publication formPrint - P
    ActionGD 2021: International Symposium on Graph Drawing and Network Visualization /29./
    Event date14.09.2021 - 17.09.2021
    VEvent locationTübingen
    CountryDE - Germany
    Event typeWRD
    Languageeng - English
    CountryCH - Switzerland
    KeywordsGraph drawing ; Non-homotopic loops ; Curve intersections ; Plane
    OECD categoryPure mathematics
    R&D ProjectsGJ20-27757Y GA ČR - Czech Science Foundation (CSF)
    Institutional supportUIVT-O - RVO:67985807
    EID SCOPUS85122149272
    DOI10.1007/978-3-030-92931-2_15
    AnnotationLet V_n be a set of n points in the plane and let x∈V_n . An x-loop is a continuous closed curve not containing any point of V_n . We say that two x-loops are non-homotopic if they cannot be transformed continuously into each other without passing through a point of Vn . For n=2, we give an upper bound e^O(k^(1/2)) on the maximum size of a family of pairwise non-homotopic x-loops such that every loop has fewer than k self-intersections and any two loops have fewer than k intersections. The exponent O(k^(1/2)) is asymptotically tight. The previous upper bound 2^((2k)^4) was proved by Pach et al. [6]. We prove the above result by proving the asymptotic upper bound e^O(k^(1/2)) for a similar problem when x∈V_n, and by proving a close relation between the two problems.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2022
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.