Many touchings force many crossings
Autor: | János Pach, Géza Tóth |
---|---|
Rok vydání: | 2019 |
Předmět: |
Combinatorics
Planar curve Computational Theory and Mathematics 010201 computation theory & mathematics Plane (geometry) The Intersect 010102 general mathematics Discrete Mathematics and Combinatorics 0102 computer and information sciences 0101 mathematics 01 natural sciences Theoretical Computer Science Mathematics |
Zdroj: | Journal of Combinatorial Theory, Series B. 137:104-111 |
ISSN: | 0095-8956 |
DOI: | 10.1016/j.jctb.2018.12.002 |
Popis: | Given n continuous open curves in the plane, we say that a pair is touching if they have finitely many interior points in common and at these points the first curve does not get from one side of the second curve to its other side. Otherwise, if the two curves intersect, they are said to form a crossing pair. Let t and c denote the number of touching pairs and crossing pairs, respectively. We prove that c ≥ 1 10 5 t 2 n 2 , provided that t ≥ 10 n . Apart from the values of the constants, this result is best possible. |
Databáze: | OpenAIRE |
Externí odkaz: |