稀疏图的分离维数
Separation dimension of sparse graphs
摘要:
图$G$的分离维数是最小的自然数$k$,对于该最小的自然数$k$,$G$的顶点可以嵌入到$\mathbb{R}^k$中,使得$G$中的任何一对不相交的边可以被垂直于其中一个轴的超平面分离。等价地,它是$G$的顶点置换族$\mathcal{F}$的最小可能基数,使得对于$G$的任何两个不相交的边,在$\mathcal{F}$中存在至少一个置换,其中一个边中的所有顶点都先于另一个边中的顶点。一般来说,$n$顶点上的图的最大分离维数是$Θ(\log n)$。本文主要研究稀疏图,证明了$k$ -退化图在$n$顶点上的最大分离维数为$O(k \log\log n)$,并证明了存在一族分离维数为$Ω(\log\log n)$的$2$ -退化图.我们还证明了通过对另一个图$G$的每条边进行一次细分而得到的图$G^{1/2}$的分离维数至多为$(1 + o(1)) \log\log χ(G)$,其中$χ(G)$是原始图的色数。
英文摘要:
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 permutations of the vertices of $G$ such that for any two disjoint edges of $G$, there exists at least one permutation 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 sparse graphs and show that the maximum separation dimension of a $k$-degenerate graph on $n$ vertices is $O(k \log\log n)$ and that there exists a family of $2$-degenerate graphs with separation dimension $Ω(\log\log n)$. We also show that the separation dimension of the graph $G^{1/2}$ obtained by subdividing once every edge of another graph $G$ is at most $(1 + o(1)) \log\log χ(G)$ where $χ(G)$ is the chromatic number of the original graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。