图的分数分离维数与循环分离维数
Fractional and Circular Separation Dimension of Graphs
摘要:
图$G$的分离维数(separation dimension),写作$π(G)$,是$V(G)$的最小线性排序数,使得每两个非关联边在某种排序中是“分离的”,这意味着一个边的两个端点都出现在另一个边的两个端点之前。我们引入分数分离维数$π_f(G)$,这是最小的$a/b$,使一些$a$线性排序(允许重复)分离每两个非入射边缘至少$b$倍。与分离维数相反,分数分离维数是有界的:总是$π_f(G)\le 3$,当且仅当$G$包含$K_4$时相等。甚至对于二部图也没有更强的界,因为$π_f(K_{m,m})=π_f(K_{m+1,m})=\frac{3m}{m+1}$。我们还计算$π_f(G)$的周期和一些完全的三部图。我们表明,$π_f(G)<\sqrt 2$时$G$是一棵树,并提出了一个序列的树上的值趋于$4/3$。最后,我们考虑类似的问题,循环排序,对nonincident边缘分离,除非他们的端点交替。令$π^\circ(G)$为分离所有对所需的循环排序数,$π_f^\circ(G)$为分数形式。我们的结果包括:(1)$π^\circ(G)=1$当且仅当$G$是外平面的。(2)$π^\circ(G)\le2$(当$G$为二分时)。(3)$π^\circ(K_n)\ge\log_2\log_3(n-1)$。(4)$π_f^\circ(G)\le\frac{3}{2}$,等式当且仅当$K_4\subseteq G$。(5)$π_f^\circ(K_{m,m})=\frac{3m-3}{2m-1}$。
英文摘要:
The separation dimension of a graph $G$, written $π(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before both endpoints of the other. We introduce the fractional separation dimension $π_f(G)$, which is the minimum of $a/b$ such that some $a$ linear orderings (repetition allowed) separate every two nonincident edges at least $b$ times. In contrast to separation dimension, fractional separation dimension is bounded: always $π_f(G)\le 3$, with equality if and only if $G$ contains $K_4$. There is no stronger bound even for bipartite graphs, since $π_f(K_{m,m})=π_f(K_{m+1,m})=\frac{3m}{m+1}$. We also compute $π_f(G)$ for cycles and some complete tripartite graphs. We show that $π_f(G)<\sqrt 2$ when $G$ is a tree and present a sequence of trees on which the value tends to $4/3$. Finally, we consider analogous problems for circular orderings, where pairs of nonincident edges are separated unless their endpoints alternate. Let $π^\circ(G)$ be the number of circular orderings needed to separate all pairs and $π_f^\circ(G)$ be the fractional version. Among our results: (1) $π^\circ(G)=1$ if and only $G$ is outerplanar. (2) $π^\circ(G)\le2$ when $G$ is bipartite. (3) $π^\circ(K_n)\ge\log_2\log_3(n-1)$. (4) $π_f^\circ(G)\le\frac{3}{2}$, with equality if and only if $K_4\subseteq G$. (5) $π_f^\circ(K_{m,m})=\frac{3m-3}{2m-1}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。