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

2K 2-free图的Brook定理的改进

Improvement on Brook theorem for 2K2-free Graphs

Medha Dhurandhar

摘要:

本文证明了对于最大度大于等于5的2K 2-free图G,其色数小于等于max{最大度-1,最大团数}.这意味着Borodin & Kostochka猜想对2K 2-free图成立。

英文摘要:

Here we prove that for a 2K2-free graph G with maximum degree greater than or equal to 5, the chromatic number is less than or equal to max{maximum degree-1, maximum clique size}. This implies that Borodin & Kostochka Conjecture is true for 2K2-free graphs.

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

↑