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

图的强荫度

Strong arboricity of graphs

Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk, Zofia Miechowicz

摘要:

如果没有圈是单色的,则图$G$的边染色是\emph{woody}。图$G$的\emph{arboricity},用$\arb (G)$表示,是$G$的木质着色所需的最少颜色数。$G$的着色是\emph{strongly woody},如果在任何一边收缩后它仍然是木质的。换句话说,不仅$G$中的任何循环可以是单色的,而且任何\emph{broken cycle},即,从循环中删除一条边所产生的简单路径。$G$的强木质着色中的最少颜色数用$ζ(G)$表示,称为$G$的\emph{strong arboricity}。我们证明了$ζ(G)\leqslant χ_a(G)$,其中$χ_a(G)$是$G$的\emph{acyclic chromatic number}(在没有$2$着色循环的情况下,正常顶点着色中的最少颜色数)。特别地,我们得到了平面图的$ζ(G)\leqslant 5$和超平面图的$ζ(G)\leqslant 4$.我们猜想$ζ(G)\leqslant 4$对所有平面图成立。我们还证明了$ζ(G)\leqslant 4(\arb(G))^2$对任意图$G$成立。强荫性的自然推广\emph{matroids}也进行了讨论,特别侧重于上图拟阵。

英文摘要:

An edge coloring of a graph $G$ is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph $G$, denoted by $\arb (G)$, is the least number of colors needed for a woody coloring of $G$. A coloring of $G$ is \emph{strongly woody} if after contraction of any single edge it is still woody. In other words, not only any cycle in $G$ can be monochromatic but also any \emph{broken cycle}, i.e., a simple path arising by deleting a single edge from the cycle. The least number of colors in a strongly woody coloring of $G$ is denoted by $ζ(G)$ and called the \emph{strong arboricity} of $G$. We prove that $ζ(G)\leqslant χ_a(G)$, where $χ_a(G)$ is the \emph{acyclic chromatic number} of $G$ (the least number of colors in a proper vertex coloring without a $2$-colored cycle). In particular, we get that $ζ(G)\leqslant 5$ for planar graphs and $ζ(G)\leqslant 4$ for otuterplanar graphs. We conjecture that $ζ(G)\leqslant 4$ holds for all planar graphs. We also prove that $ζ(G)\leqslant 4(\arb(G))^2$ holds for arbitrary graph $G$. A natural generalziation of strong arboricity to \emph{matroids} is also discussed, with a special focus on cographic matroids.

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

↑