arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.06299math.COcs.DC
收藏

有向图中着色游走的理论

A Theory for Coloring Walks in a Digraph

Seth Chaiken

AI总结:

该研究将有向图边着色推广到k游走的偏序集着色,结合下序理想构造与Birkhoff映射A,证明k游走P着色等价于迭代k-1次A的顶点偏序着色,推广并简化了有向色指数问题。

摘要:

考虑有向图的边着色,其中边$v_1v_2$与$v_2v_3$具有不同颜色。这种着色通过边颜色集合诱导出一种顶点着色,图中的边$v_1v_2$意味着$v_1$的集合颜色包含一个不在$v_2$集合颜色中的元素,反之亦然。我们将其推广到$k$(顶点)游走的着色,其定义为:若两个游走分别是同一个$(k+1)$游走的前缀$c_1$和后缀$c_2$,则它们具有不同颜色。此外,颜色可属于偏序集$P$,其中$c_1$、$c_2$必须满足$c_1 \not\leq c_2$。这种集合构造将$P$中的下序理想从一组$k$游走颜色中推广出来;这些序理想按包含关系构成偏序。我们得出结论:$k$游走的$P$着色存在,当且仅当存在通过在$P$上迭代$k-1$次$A$的顶点着色,其中Birkhoff的$A$将一个偏序集映射到其下序理想的偏序集。由此,有向色指数问题被推广并简化为顶点的偏序集着色。本工作采用了Cole和Vishkin关于确定性抛硬币的思想、结果与动机,以及Becker和Simon关于$(n-2)$立方体子集顶点覆盖的相关成果。

英文摘要:

Consider edge colorings of digraphs where edges $v_1 v_2$ and $v_2 v_3$ have different colors. This coloring induces a vertex coloring by sets of edge colors, in which edge $v_1 v_2$ in the graph implies that the set color of $v_1$ contains an element not in the set color of $v_2$, and conversely. We generalize to colorings of $k$(vertex)-walks, defined so two walks have different colors if one is the prefix $c_1$ and the other is the suffix $c_2$ of a common $(k+1)$-walk. Further, the colors can belong to a poset $P$ where $c_1$, $c_2$ must satisfy $c_1 \not\leq c_2$. This set construction generalizes the lower order ideal in $P$ from a set of $k$-walk colors; these order ideals are partially ordered by containment. We conclude that a $P$ coloring of $k$-walks exists iff there is a vertex coloring by $A$ iterated $k-1$ times on $P$, where Birkhoff's $A$ maps a poset to its poset of lower order ideals. Thus the directed chromatic index problem is generalized and reduced to poset coloring of vertices. This work uses ideas, results and motivations due to Cole and Vishkin on deterministic coin tossing and Becker and Simon on vertex covers for subsets of $(n-2)$-cubes.

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

↑