arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.02077math.COcs.CG
收藏

Jordan曲线的一个交线引理

A Crossing Lemma for Jordan Curves

János Pach, Natan Rubin, Gábor Tardos

摘要:

如果平面上的两条约当曲线恰好有一个公共点,并且在那里它们没有正确相交,则该公共点称为{ \em接触点}。本文的主要结果是简单曲线的一个交引理:设$X$和$T$分别表示平面上$n$简单曲线族的交点和接触点的集合,其中没有三条曲线通过同一点。如果$|T|>cn$,对于某个固定常数$c>0$,则证明了$|X|=Ω(|T|(\log\log(|T|/n))^{1/504})$ .特别地,如果是$|T|/n\rightarrow\infty$,则交叉点的数量远大于接触点的数量。作为推论,我们证实了Richter和Killassen的以下长期猜想:$n$两两相交的简单闭(即,Jordan)的曲线,其中没有三条曲线通过同一点,至少是$(1-o(1))n^2$。

英文摘要:

If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a {\em touching point}. The main result of this paper is a Crossing Lemma for simple curves: Let $X$ and $T$ stand for the sets of intersection points and touching points, respectively, in a family of $n$ simple curves in the plane, no three of which pass through the same point. If $|T|>cn$, for some fixed constant $c>0$, then we prove that $|X|=Ω(|T|(\log\log(|T|/n))^{1/504})$. In particular, if $|T|/n\rightarrow\infty$, then the number of intersection points is much larger than the number of touching points. As a corollary, we confirm the following long-standing conjecture of Richter and Thomassen: The total number of intersection points between $n$ pairwise intersecting simple closed (i.e., Jordan) curves in the plane, no three of which pass through the same point, is at least $(1-o(1))n^2$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑