arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.3692math.CO
收藏

具有等价关系的覆盖线图

Covering line graphs with equivalence relations

L. Esperet, J. Gimbel, A. King

摘要:

一个等价图是一个不相交的团的并集,图$G$的等价数$\mathit{eq}(G)$是覆盖$G$的边所需的等价子图的最小数目。我们考虑了线图的等价数,给出了改进的上界和下界:$\frac 13 \log_2\log_2 χ(G) < \mathit{eq}(L(G)) \leq 2\log_2\log_2 χ(G) + 2$。这否定了最近的一个猜想,即对于无三角形的$G$,$\mathit{eq}(L(G))$至多为3;实际上它可以任意大。为了约束$\mathit{eq}(L(G))$,我们约束紧密相关的不变量$σ(G)$,它是$G$的最小方向数,使得对于与某个顶点$v$关联的任何两条边$e,f$,$e$和$f$都在某个方向上定向在$v$之外。当$G$无三角形时,$σ(G)=\mathit{eq}(L(G))$。我们证明,即使$G$是三角形自由,它是NP-完全决定是否$σ(G)\leq 3$。

英文摘要:

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line graph, giving improved upper and lower bounds: $\frac 13 \log_2\log_2 χ(G) < \mathit{eq}(L(G)) \leq 2\log_2\log_2 χ(G) + 2$. This disproves a recent conjecture that $\mathit{eq}(L(G))$ is at most three for triangle-free $G$; indeed it can be arbitrarily large. To bound $\mathit{eq}(L(G))$ we bound the closely-related invariant $σ(G)$, which is the minimum number of orientations of $G$ such that for any two edges $e,f$ incident to some vertex $v$, both $e$ and $f$ are oriented out of $v$ in some orientation. When $G$ is triangle-free, $σ(G)=\mathit{eq}(L(G))$. We prove that even when $G$ is triangle-free, it is NP-complete to decide whether or not $σ(G)\leq 3$.

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

↑