关于图的公平和容忍着色
On Fair and Tolerant Colorings of Graphs
AI总结:
本文研究了图的公平和容忍着色问题,证明了关于FAT色数与常规色数之间关系的两个问题均无解。
摘要:
一个图G的顶点着色(不一定是proper的)用颜色类V₁,V₂,…,V_k,被称为G的k颜色公平和容忍顶点着色,当且仅当V₁,V₂,…,V_k非空,并且存在两个实数α和β,使得α∈[0,1]和β∈[0,1],并且对于任意顶点v和任意颜色类V_i,都有|V_i ∩ N(v)|等于α°(v)如果v不属于V_i,或者β°(v)如果v属于V_i。图G的FAT色数,记为χ^{FAT}(G),定义为使得G允许k颜色公平和容忍顶点着色的最大正整数k。Beers和Mulas引入并研究了图的FAT色数的概念,他们提出了是否存在一个函数f:ℕ→ℝ,使得对于所有图G,不等式χ^{FAT}(G) ≤ f(χ(G))成立。另一个类似的有趣问题涉及是否存在某个函数g:ℕ→ℝ,使得对于每个图G,不等式χ(G) ≤ g(χ^{FAT}(G))成立。在本文中,我们证明了这两个问题都不存在正解。
英文摘要:
A (not necessarily proper) vertex coloring of a graph $G$ with color classes $V_1$, $V_2$, $\dots$, $V_k$, is said to be a {\it Fair And Tolerant vertex coloring of $G$ with $k$ colors}, whenever $V_1$, $V_2$, $\dots$, $V_k$ are nonempty and there exist two real numbers $α$ and $β$ such that $α\in [0,1]$ and $β\in [0,1]$ and the following condition holds for each arbitrary vertex $v$ and every arbitrary color class $V_i$: $$ \bigl| V_i \cap N (v) \bigr| = \begin{cases} α°(v) & \mbox{ if } \ \ v \notin V_i β°(v) & \mbox{ if } \ \ v \in V_i . \end{cases} $$ The {\it FAT chromatic number} of $G$, denoted by $χ^{\rm FAT} (G)$, is defined as the maximum positive integer $k$ for which $G$ admits a Fair And Tolerant vertex coloring with $k$ colors. The concept of the FAT chromatic number of graphs was introduced and studied by Beers and Mulas, where they asked for the existence of a function $f \colon \mathbb{N} \to \mathbb{R}$ in such a way that the inequality $χ^{\rm FAT} (G) \ \leq \ f \big( χ(G) \big)$ holds for all graphs $G$. Another similar interesting question concerns the existence of some function $g \colon \mathbb{N} \to \mathbb{R}$ such that the inequality $χ(G) \ \leq \ g \left( χ^{\rm FAT} (G) \right)$ holds for every graph $G$. In this paper, we establish that both questions admit negative resolutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。