arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.13580math.CO
收藏

色恶值的精确值与极值

Exact and extremal values of chromatic villainy

Hainan Bielefeld University of Applied Sciences(海南比尔费尔德应用科学大学)

Jiang Jiang, Yuhan Jiang, Yiyang Li, Lujia Wang, Aitao Zhang

AI总结:

针对色恶值的精确与极值问题,研究了奇环和完全多部图的色恶值,确定了奇环的最大修复距离,给出完全多部图色恶值的算术公式与有限公式,还得到了对应参数在特定图类中的最大值。

摘要:

色恶值用于衡量在保持每种颜色重数不变的情况下,修复最优着色重排时必须改变颜色的最大顶点数;弱色恶值则允许修复时具有不同的重数。对于奇环$C_{2r+1}$,我们确定了从具有规定颜色计数向量(轮廓)$\mathbf m$的任意颜色分配到具有任意可实现目标轮廓$\mathbf p$的正常着色的最大修复距离:该距离等于$2r+1-\sum_X\min\{p_X,\lceil m_X/2\rceil\}$。特别地,每个可行轮廓$(a,b,c)$都具有普通和弱修复半径$\lfloor a/2\rfloor+\lfloor b/2\rfloor+\lfloor c/2\rfloor$,且对于$r\ge2$,有$B(C_{2r+1})=r$,这回答了Clark等人提出的问题。对于任意完全多部图,我们给出了普通色恶值的算术公式,其候选数最多为$k^2$,同时给出了弱色恶值的精确有限公式,其中$k$是部集的数量。对于二进制编码的部集大小,这两个值在$k$中是固定参数可处理的。我们还确定了所有$n$顶点的$k$色图中每个参数的最大值。对于$k\ge3$,普通最大值为$\min\{n,4(n-k)\}$,除了当$n=4(n-k)-1$或$(n,k)\in\{(5,3),(7,3)\}$时,此时最大值为$n-1$。对于$k\ge2$,弱最大值为$n-\max\{\lceil n/k\rceil,2k-n\}-\varepsilon$,其中$\varepsilon\in\{0,1\}$由$n$和$k$明确确定。这两个极值都由完全多部图达到,且弱极值器最多需要三种不同的部集大小。

英文摘要:

Chromatic villainy measures the largest number of vertices that must change color to repair a rearrangement of an optimal coloring while preserving every color multiplicity. Weak villainy allows different multiplicities in the repair. On the odd cycle $C_{2r+1}$, we determine the largest repair distance from arbitrary color assignments with a prescribed color-count vector (profile) $\mathbf m$ to proper colorings with any realizable target profile $\mathbf p$: it equals $2r+1-\sum_X\min\{p_X,\lceil m_X/2\rceil\}$. In particular, every feasible profile $(a,b,c)$ has ordinary and weak repair radius $\lfloor a/2\rfloor+\lfloor b/2\rfloor+\lfloor c/2\rfloor$, and $B(C_{2r+1})=r$ for $r\ge2$, answering a question of Clark et al. For arbitrary complete multipartite graphs, we give an arithmetic formula for ordinary villainy with at most $k^2$ candidates and an exact finite formula for weak villainy, where $k$ is the number of parts. Both values are fixed-parameter tractable in $k$ for binary-encoded part sizes. We also determine the maximum of each parameter among all $n$-vertex $k$-chromatic graphs. For $k\ge3$, the ordinary maximum is $\min\{n,4(n-k)\}$, except when $n=4(n-k)-1$ or $(n,k)\in\{(5,3),(7,3)\}$, when it is $n-1$. For $k\ge2$, the weak maximum is $n-\max\{\lceil n/k\rceil,2k-n\}-\varepsilon$, where $\varepsilon\in\{0,1\}$ is determined explicitly by $n$ and $k$. Both extrema are attained by complete multipartite graphs, and a weak extremizer needs at most three distinct part sizes.

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

↑