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

图的范畴积的向量染色

Vector Coloring the Categorical Product of Graphs

Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, Antonios Varvitsiotis

摘要:

图的向量$t$ -着色是实向量$p_1, \ldots, p_n$到其顶点的分配,使得当$i$和$j$相邻时,对于所有$i=1, \ldots, n$和$p_i^Tp_j \le -1$,$p_i^Tp_i = t-1$。$G$的向量色数是使$G$的向量$t$ -着色存在的最小实数$t \ge 1$。对于图$H$和图$G$的向量$t$ -着色$p_1,\ldots,p_n$,赋值$(i,\ell) \mapsto p_i$是范畴积$G \times H$的向量$t$ -着色.因此,$G \times H$的向量色数至多是因子的向量色数的最小值。我们证明了等式总是成立的,构成一个向量着色模拟著名的Hedetniemi猜想从图着色。此外,我们证明了一个充分必要条件时,所有的最佳向量着色的产品可以表示的最佳向量着色的因素。向量色数与著名的Lovász theta函数密切相关,这两个参数都允许将公式作为半定规划。这种与半定规划的联系对我们的工作至关重要,我们开发的工具和技术可能会引起该领域其他人的兴趣。

英文摘要:

A vector $t$-coloring of a graph is an assignment of real vectors $p_1, \ldots, p_n$ to its vertices such that $p_i^Tp_i = t-1$ for all $i=1, \ldots, n$ and $p_i^Tp_j \le -1$ whenever $i$ and $j$ are adjacent. The vector chromatic number of $G$ is the smallest real number $t \ge 1$ for which a vector $t$-coloring of $G$ exists. For a graph $H$ and a vector $t$-coloring $p_1,\ldots,p_n$ of a graph $G$, the assignment $(i,\ell) \mapsto p_i$ is a vector $t$-coloring of the categorical product $G \times H$. It follows that the vector chromatic number of $G \times H$ is at most the minimum of the vector chromatic numbers of the factors. We prove that equality always holds, constituting a vector coloring analog of the famous Hedetniemi Conjecture from graph coloring. Furthermore, we prove a necessary and sufficient condition for when all of the optimal vector colorings of the product can be expressed in terms of the optimal vector colorings of the factors. The vector chromatic number is closely related to the well-known Lovász theta function, and both of these parameters admit formulations as semidefinite programs. This connection to semidefinite programming is crucial to our work and the tools and techniques we develop could likely be of interest to others in this field.

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

↑