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

具有$χ=Δ$的图具有大团

Graphs with $χ=Δ$ have big cliques

Daniel W. Cranston, Landon Rabern

摘要:

Brooks定理指出,如果一个图有$Δ\ge 3$和$ω\le Δ$,则有$χ\le Δ$。Borodin和Kostochka证明,如果$Δ\ge 9$和$ω\le Δ-1$,那么$χ\le Δ-1$。我们表明,如果$Δ\ge 13$和$ω\le Δ-4$,那么$χ\le Δ-1$。对于图$G$,设$\mathcal{H}$表示由度为$Δ$的顶点导出的$G$的子图。我们还表明,如果$ω\le Δ-1$和$ω(\mathcal{H})\le Δ-6$,那么$χ\le Δ-1$。

英文摘要:

Brooks' Theorem states that if a graph has $Δ\ge 3$ and $ω\le Δ$, then $χ\le Δ$. Borodin and Kostochka conjectured that if $Δ\ge 9$ and $ω\le Δ-1$, then $χ\le Δ-1$. We show that if $Δ\ge 13$ and $ω\le Δ-4$, then $χ\le Δ-1$. For a graph $G$, let $\mathcal{H}$ denote the subgraph of $G$ induced by vertices of degree $Δ$. We also show that if $ω\le Δ-1$ and $ω(\mathcal{H})\le Δ-6$, then $χ\le Δ-1$.

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

↑