arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.5627math.MGmath.CO
收藏

线间无适当包含的图度量

Graph metric with no proper inclusion between lines

Xiaomin Chen, Guangda Huzhang, Peihan Miao, Kuan Yang

摘要:

在试图推广经典的Sylvester-Gallai定理和De Bruijn-Erdés定理在平面几何中,线和闭包线先前被定义为度量空间和超图。这两个定义都不符合几何直观,因为两条线(闭合线)可以相交于多个点,并且一条线(闭合线)可能是另一条线的真子集。在这项工作中,我们研究的系统中的一个或两个配置是禁止的。我们注意到,当任意两条直线至多相交于一点时,这两个经典定理在任意度量空间中推广。研究了由单图导出的度量空间,其中没有一条线是另一条线的真子集,证明了具有$n$顶点的简单图的最少线数介于$n^{4/3}$和$n^{4/3} \ln^{2/3} n$的阶之间.

英文摘要:

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erdős theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric intuition in the sense that two lines (closure lines) may intersect at more than one point, and one line (closure line) might be the proper subset of another. In this work, we study the systems where one or both of the configurations are forbidden. We note that when any two lines intersect in at most one point, the two classic theorems extend in any metric space. We study the metric spaces induced by simple graphs where no line is a proper subset of another, and show that the least number of lines for such a graph with $n$ vertices is between the order of $n^{4/3}$ and $n^{4/3} \ln^{2/3} n$.

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

↑