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

$t$-$(Δ+t)$的核心-边缘着色

$t$-cores for $(Δ+t)$-edge-colouring

Jessica McDonald, Gregory J. Puleo

摘要:

将核(由最大度顶点导出的子图)的边染色概念推广到$t$ -核(由顶点$v$和$d(v)+μ(v)> Δ+t$导出的子图),并得到了$(Δ+t)$ -边染色的一个充分条件.特别是,我们表明,对于任何$t\geq 0$,如果$t$核心的$G$具有多重性在大多数$t+1$,其边缘的多重性$t+1$诱导多森林,然后$χ'(G) \leq Δ+t$。这扩展了Ore,Fournier,Berge和Fournier以前的工作。一个更强的版本,我们的结果(取代多森林条件的顶点排序条件)推广了一个定理的霍夫曼和罗杰的核心$Δ$ -边列简单图。事实上,我们的界限不仅适用于色指数,但\emph{fan number}的图,一个参数引入Scheide和Stiebitz作为上界的色指数。我们能够给出图$H$的一个精确的特征,使得当$G$以$H$为$t$ -核时,$\mathrm{Fan}(G) \leq Δ(G)+t$.

英文摘要:

We extend the edge-coloring notion of core (subgraph induced by the vertices of maximum degree) to $t$-core (subgraph induced by the vertices $v$ with $d(v)+μ(v)> Δ+t$), and find a sufficient condition for $(Δ+t)$-edge-coloring. In particular, we show that for any $t\geq 0$, if the $t$-core of $G$ has multiplicity at most $t+1$, with its edges of multiplicity $t+1$ inducing a multiforest, then $χ'(G) \leq Δ+t$. This extends previous work of Ore, Fournier, and Berge and Fournier. A stronger version of our result (which replaces the multiforest condition with a vertex-ordering condition) generalizes a theorem of Hoffman and Rodger about cores of $Δ$-edge-colourable simple graphs. In fact, our bounds hold not only for chromatic index, but for the \emph{fan number} of a graph, a parameter introduced by Scheide and Stiebitz as an upper bound on chromatic index. We are able to give an exact characterization of the graphs $H$ such that $\mathrm{Fan}(G) \leq Δ(G)+t$ whenever $G$ has $H$ as its $t$-core.

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

↑