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

图中多项式计数群着色

Polynomials Counting Group Colorings in Graphs

Guangzhou University(广州大学)

Houshan Fu

AI总结:

本文定义了α-兼容图和循环分配多项式,用于计数图中的(A,f)-着色,并展示了多项式系数与可接受分配的关系。

摘要:

Jaeger等人于1992年将群着色作为图中群连通性的对偶概念引入。令A为加法阿贝尔群,f:E(G)→A和D为图G的一个定向。一个顶点着色c:V(G)→A是(A,f)-着色,如果对于每个由u到v指向的定向边e=uv,有c(v)-c(u)≠f(e)。Kochol最近引入了分配多项式来计数图中的非零链——非齐次的非零流的类比,并后来将其方法扩展到正则矩阵列中。受Kochol工作的启发,我们定义了α-兼容图和在k处的循环分配多项式P(G, α; k),基于α-兼容的生成子图,其中α是将图G的循环分配到{0,1}中的分配。我们证明,对于任何阿贝尔群A的阶为k和f:E(G)→A,使得由f给出的分配α_{D,f}等于α的多项式P(G,α;k)计数G的(A,f)-着色数量。这样的分配是可接受的。基于Kochol的工作,我们推导出k^{-c(G)}P(G,α;k)是一个计数(A,f)-张力和特定非零链的多项式。此外,通过将Whitney的破碎循环概念扩展到破碎兼容循环,我们证明了P(G,α;k)中与可接受分配α相关的系数的绝对值等于具有i条边且不含破碎α-兼容循环的α-兼容生成子图的数量。根据组合解释,我们建立了从可接受分配到循环分配多项式的一致顺序保持关系,并进一步证明,对于任何具有α(e)=1的可接受分配α的图G,P(G,α;k)的系数非零且符号交替。

英文摘要:

Jaeger et al. in 1992 introduced group coloring as the dual concept to group connectivity in graphs. Let $A$ be an additive Abelian group, $ f: E(G)\to A$ and $D$ an orientation of a graph $G$. A vertex coloring $c:V(G)\to A$ is an $(A, f)$-coloring if $c(v)-c(u)\ne f(e)$ for each oriented edge $e=uv$ from $u$ to $v$ under $D$. Kochol recently introduced the assigning polynomial to count nowhere-zero chains in graphs--nonhomogeneous analogues of nowhere-zero flows in \cite{Kochol2022}, and later extended the approach to regular matroids in \cite{Kochol2024}. Motivated by Kochol's work, we define the $α$-compatible graph and the cycle-assigning polynomial $P(G, α; k)$ at $k$ in terms of $α$-compatible spanning subgraphs, where $α$ is an assigning of $G$ from its cycles to $\{0,1\}$. We prove that $P(G,α;k)$ evaluates the number of $(A,f)$-colorings of $G$ for any Abelian group $A$ of order $k$ and $f:E(G)\to A$ such that the assigning $α_{D,f}$ given by $f$ equals $α$. Such an assigning is admissible. Based on Kochol's work, we derive that $k^{-c(G)}P(G,α;k)$ is a polynomial enumerating $(A,f)$-tensions and counting specific nowhere-zero chains. Furthermore, by extending Whitney's broken cycle concept to broken compatible cycles, we show that the absolute value of the coefficient of $k^{|V(G)|-i}$ in $P(G,α;k)$ associated with admissible assignings $α$ equals the number of $α$-compatible spanning subgraphs that have $i$ edges and contain no broken $α$-compatible cycles. According to the combinatorial explanation, we establish a unified order-preserving relation from admissible assignings to cycle-assigning polynomials, and further show that for any admissible assigning $α$ of $G$ with $α(e)=1$ for every loop $e$, the coefficients of $P(G,α;k)$ are nonzero and alternate in sign.

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

↑