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

DP着色函数与超图的色多项式(I)

DP color functions versus chromatic polynomials for hypergraphs (I)

School of Mathematics and Statistics, Beijing Jiaotong University(北京交通大学数学与统计学院);National Institute of Education, Nanyang Technological University(南洋理工大学国立教育学院)

Ruiyi Cui, Liangxia Wan, Fengming Dong

AI总结:

研究DP着色函数与色多项式的关系,探讨最小循环长度对DP着色函数的影响及超图连接后的性质。

摘要:

对于超图H,DP着色函数P_DP(H,k)是色多项式P(H,k)的扩展,具有性质P_DP(H,k) ≤ P(H,k)对于所有正整数k。本文主要研究最小循环长度对DP着色函数的影响,以及H∨K_p(即H和K_p的连接)的DP着色函数的相关性质。我们证明,对于任何线性且均匀的超图H,若其环长为偶数,则存在正整数N,使得对于所有整数k≥N,P_DP(H,k) < P(H,k),并且这一结论也适用于任何包含边e的超图H,其中H-e恰好有|e|-1个连通分量,并且H中任何包含e的最短循环都是偶数循环。对于超图H∨K_p,我们证明如果H是均匀的,则存在正整数p和N,使得对于所有整数k≥N,P_DP(H∨K_p,k)=P(H∨K_p,k)成立。

英文摘要:

For a hypergraph $\mathcal{H}$, the DP color function $P_{DP}(\mathcal{H},k)$ of $\mathcal{H}$ is an extension of the chromatic polynomial $P(\mathcal{H},k)$ with the property that $P_{DP}(\mathcal{H},k) \le P(\mathcal{H},k)$ for all positive integers $k$. In this article, we primarily investigate the influence of the minimum cycle length on the DP-coloring function, as well as the relevant properties of the DP-coloring function of $\mathcal{H} \vee K_p$ (i.e., the join of $\mathcal{H}$ and $K_p$). We show that for any linear and uniform hypergraph $\mathcal H$ with even girth, there exists a positive integer $N$ such that $P_{DP} (\mathcal H, k) < P(\mathcal H, k)$ for all integers $k\ge N$, and this conclusion also holds for any hypergraph $\mathcal{H}$ that contains an edge $e$ with the properties that $\mathcal{H}-e$ has exactly $|e|-1$ components and any shortest cycle in $\mathcal{H}$ containing $e$ is an even cycle. For the hypergraph $\mathcal{H}\vee K_p$, we prove that if $\mathcal{H}$ is uniform, then there exist positive integers $p$ and $N$ such that $P_{DP}(\mathcal{H} \vee K_p,k)=P(\mathcal{H} \vee K_p,k)$ holds for all integers $k\geq N$.

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

↑