路的反Ramsey数的计算复杂性
Complexity of Computing the Anti-Ramsey Numbers for Paths
摘要:
反Ramsey数是图论中的一个基本概念,由Erd\”os,Simonovits和S\“os于1978年提出。对于给定的图$G$和$H$,定义\emph{anti-Ramsey number} $\textrm{ar}(G,H)$为最大数$k$,使得存在$k$颜色分配给$G$的边,其中$G$中的每个$H$拷贝至少有两条边具有相同的颜色。当$H$为星形时,已有文献研究了该问题的计算复杂性.沿着这条研究路线,我们研究了计算反拉姆齐数$\textrm{ar}(G,P_k)$的复杂性,其中$P_k$是长度为$k$的路径。首先,我们观察到,当$k = Ω(n)$,问题是困难的,因此,具有挑战性的部分是当$k$是一个固定常数的问题的计算复杂性。我们提供了一个表征的问题的路径长度恒定。我们的第一个主要贡献是证明计算$\textrm{ar}(G,P_k)$的每一个整数$k>2$是NP-难的。我们通过提供图中这种着色的几个结构性质来获得这一点。我们进一步研究并表明,近似$\textrm{ar}(G,P_3)$的$n^{-1/2 - ε}$的一个因素已经很难在$3$ -部图,除非P=NP。我们还研究了预着色版本的精确复杂性,并表明除非ETH对任何固定常数$k$失败,否则该问题没有次指数算法。考虑到问题的逼近和参数化的困难,研究限制图族上的问题是很自然的。我们引入了色连通着色的概念,并利用这一结构性质。当宿主图$G$是树时,对于任意整数$k$,我们得到了计算$\textrm{ar}(G,P_k)$的线性时间算法.
英文摘要:
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs $G$ and $H$ the \emph{anti-Ramsey number} $\textrm{ar}(G,H)$ is defined to be the maximum number $k$ such that there exists an assignment of $k$ colors to the edges of $G$ in which every copy of $H$ in $G$ has at least two edges with the same color. There are works on the computational complexity of the problem when $H$ is a star. Along this line of research, we study the complexity of computing the anti-Ramsey number $\textrm{ar}(G,P_k)$, where $P_k$ is a path of length $k$. First, we observe that when $k = Ω(n)$, the problem is hard; hence, the challenging part is the computational complexity of the problem when $k$ is a fixed constant. We provide a characterization of the problem for paths of constant length. Our first main contribution is to prove that computing $\textrm{ar}(G,P_k)$ for every integer $k>2$ is NP-hard. We obtain this by providing several structural properties of such coloring in graphs. We investigate further and show that approximating $\textrm{ar}(G,P_3)$ to a factor of $n^{-1/2 - ε}$ is hard already in $3$-partite graphs, unless P=NP. We also study the exact complexity of the precolored version and show that there is no subexponential algorithm for the problem unless ETH fails for any fixed constant $k$. Given the hardness of approximation and parametrization of the problem, it is natural to study the problem on restricted graph families. We introduce the notion of color connected coloring and employing this structural property. We obtain a linear time algorithm to compute $\textrm{ar}(G,P_k)$, for every integer $k$, when the host graph, $G$, is a tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。