arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.5075math.COcs.DM
收藏

有界度图的分离维数

Separation dimension of bounded degree graphs

Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

摘要:

图$G$的“分离维数”是最小的自然数$G$,对于该最小的自然数$G$,$G$的顶点可以嵌入到$\mathbb{R}^k$中,使得$G$中的任何一对不相交的边可以被垂直于其中一个轴的超平面分离。等价地,它是$G$的顶点的全序族$\mathcal{F}$的最小可能基数,使得对于$G$的任何两个不相交的边,在$\mathcal{F}$中存在至少一个全序,其中一个边中的所有顶点先于另一个边中的所有顶点。一般来说,$n$顶点上的图的最大分离维数是$Θ(\log n)$。在这篇文章中,我们专注于有界度图,并证明了最大度$d$的图的分离维数至多为$2^{9log^{\star} d} d$。我们还证明了上述界是近紧的,表明,对于每一个$d$,几乎所有的$d$ -正则图的分离维数至少$\lceil d/2\rceil$。

英文摘要:

The 'separation dimension' of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family $\mathcal{F}$ of total orders of the vertices of $G$ such that for any two disjoint edges of $G$, there exists at least one total order in $\mathcal{F}$ in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on $n$ vertices is $Θ(\log n)$. In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree $d$ is at most $2^{9log^{\star} d} d$. We also demonstrate that the above bound is nearly tight by showing that, for every $d$, almost all $d$-regular graphs have separation dimension at least $\lceil d/2\rceil$.

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

↑