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

Borodin猜想和Kostochka猜想对无{4倍K1 }图的有效性

Validity of Borodin and Kostochka Conjecture for {4 Times K1}-free Graphs

Medha Dhurandhar

摘要:

寻找偶3 K1-free图的色数的最优上界问题仍然是一个开放的、相当困难的问题。本文证明了4K 1-free图G的Borodin & Kostochka猜想,即如果一个{4 Times K1}-free图的最大度大于或等于9,则该图的色数小于或等于ω和{δ-1}的最大值。

英文摘要:

Problem of finding an optimal upper bound for the chromatic no. of even 3K1-free graphs is still open and pretty hard. Here we prove Borodin & Kostochka Conjecture for 4K1-free graphs G i.e. If maximum degree of a {4 Times K1}-free graph is greater than or equal to 9, then the chromatic number of the graph is less than or equal to maximum of ω and {δ-1}.

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

↑