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

某些图的非重复色数新下界

New lower bounds on the non-repetitive chromatic number of some graphs

School of Mathematical Sciences Fudan University(复旦大学数学科学学院);Palomar College(帕洛马学院)

Tianyi Tao, Junchi Zhang, Wentao Zhang, Alex Toole

AI总结:

本文研究了图的非重复着色问题,通过形式化定义非重复色数π(G),针对两条无限路径的笛卡尔积和强积分别证明了π(P□P)≥6和π(P⊠P)≥9的新下界,改进了已有结果。

摘要:

如果图 G 中没有任何简单路径的顶点颜色序列构成重复,则称图 G 是(顶点)非重复着色的。形式上,着色 c: V(G) -> {1, 2, ..., k} 是非重复的,如果对于 G 中的每条路径 <v_1, v_2, ..., v_{2m}>,颜色序列 c(v_1), c(v_2), ..., c(v_{2m}) 不呈 ww 的形式,其中 w 是长度为 m 的颜色序列。实现这种着色所需的最少颜色数称为图 G 的非重复色数,记为 π(G)。在本文中,我们主要证明了 π(P □ P) ≥ 6 和 π(P ⊠ P) ≥ 9,其中 P □ P 和 P ⊠ P 分别是两条无限路径的笛卡尔积和强积。这改进了此前最佳的下界。

英文摘要:

A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G) \to \{1, 2, \dots, k\} \) is non-repetitive if, for every path \(\langle v_1, v_2, \dots, v_{2m} \rangle\) in \( G \), the sequence of colors \( c(v_1), c(v_2), \dots, c(v_{2m}) \) is not of the form \( ww \), where \( w \) is a sequence of \( m \) colors. The minimum number of colors required for such a coloring is called the \emph{non-repetitive chromatic number} of \(G\), denoted by \(π(G)\). In this paper, we primarily prove that \(π(P \square P) \ge 6\) and \(π(P \boxtimes P) \ge 9\), where \( P \square P \) and \( P \boxtimes P \) are the Cartesian product and the strong product of two infinite paths, respectively. This improves upon the previous best lower bounds.

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

↑