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

图的染色的改进界

Improved bounds on coloring of graphs

Sokol Ndreca, Aldo Procacci, Benedetto Scoppola

摘要:

给定一个最大度为$Δ\ge 3$的图$G$,证明了$G$的无圈边色数$a'(G)$使得$a'(G)\le\lceil 9.62 (Δ-1)\rceil$ .此外,我们证明:如果$G$具有周长$g\ge 5\,$,则为$a'(G)\le \lceil 6.42(Δ-1)\rceil$;如果$G$具有周长$g\ge 7$,则为$a'(G)\le \lceil5.77 (Δ-1)\rc$;如果$g\ge 53$,则为$a'(G)\le \lc4.52(\D-1)\rc$;如果$g\ge \lceil25.84\D\log\D(1+ 4.1/\log\D)\rceil$,则为$a'(G)\le \D+2\,$。进一步证明了$G$的无圈(点)色数$a(G)$使得$a(G)\le \lc 6.59 Δ^{4/3}+3.3\D\rc$ .我们还证明了PDMATHBMM的星色数PDMATHBNA使得$χ_s(G)\le \lc4.34Δ^{3/2}+ 1.5\D\rc$ .最后证明了$G$的$\b$ -节俭色数$χ^\b(G)$使得$χ^\b(G)\le \lc\max\{k_1(\b)\D,\; k_2(\b){\D^{1+1/\b}/ (\b!)^{1/\b}}\}\rc$,其中$k_1(\b)$和$k_2(\b)$是$\b$的减函数使得$k_1(\b)\in[4, 6]$和$k_2(\b)\in[2,5]$ .为了获得这些结果,我们使用了一个改进版本的Lovász局部引理由于Bissacot,Fernández,Procacci和Scoppola \cite{BFPS}。

英文摘要:

Given a graph $G$ with maximum degree $Δ\ge 3$, we prove that the acyclic edge chromatic number $a'(G)$ of $G$ is such that $a'(G)\le\lceil 9.62 (Δ-1)\rceil$. Moreover we prove that: $a'(G)\le \lceil 6.42(Δ-1)\rceil$ if $G$ has girth $g\ge 5\,$; $a'(G)\le \lceil5.77 (Δ-1)\rc$ if $G$ has girth $g\ge 7$; $a'(G)\le \lc4.52(\D-1)\rc$ if $g\ge 53$; $a'(G)\le \D+2\,$ if $g\ge \lceil25.84\D\log\D(1+ 4.1/\log\D)\rceil$. We further prove that the acyclic (vertex) chromatic number $a(G)$ of $G$ is such that $a(G)\le \lc 6.59 Δ^{4/3}+3.3\D\rc$. We also prove that the star-chromatic number $χ_s(G)$ of $G$ is such that $χ_s(G)\le \lc4.34Δ^{3/2}+ 1.5\D\rc$. We finally prove that the $\b$-frugal chromatic number $χ^\b(G)$ of $G$ is such that $χ^\b(G)\le \lc\max\{k_1(\b)\D,\; k_2(\b){\D^{1+1/\b}/ (\b!)^{1/\b}}\}\rc$, where $k_1(\b)$ and $k_2(\b)$ are decreasing functions of $\b$ such that $k_1(\b)\in[4, 6]$ and $k_2(\b)\in[2,5]$. To obtain these results we use an improved version of the Lovász Local Lemma due to Bissacot, Fernández, Procacci and Scoppola \cite{BFPS}.

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

↑