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

Gyárfás-Sumner猜想的多对数界

Polylogarithmic bound for the Gyárfás-Sumner conjecture

Faculty of Mathematics, University of Vienna(维也纳大学数学学院)

Martin Bierbaumer, Matija Bucić

AI总结:

针对Gyárfás-Sumner猜想,在Nguyen等人证明色数至多为|G|^{o(1)}的基础上,将其改进为多对数界(log|G|)^{O(1)}。

摘要:

经典Gyárfás-Sumner猜想指出,对于任意固定森林F,任何不含F作为诱导子图且团数ω(G)有界的图G,其色数χ(G)有界。Nguyen、Scott和Seymour近期证明此类图的色数至多为|G|^{o(1)},我们将该界改进为多对数界(log|G|)^{O(1)}。

英文摘要:

The classical Gyárfás-Sumner conjecture asserts that for any fixed forest $F$, any graph $G$ not containing $F$ as an induced subgraph, with bounded clique number $ω(G)$, has bounded chromatic number $χ(G)$. Recently, Nguyen, Scott, and Seymour proved that every such graph has chromatic number at most $|G|^{o(1)}$. We improve this bound to a polylogarithmic one $(\log |G|)^{O(1)}$.

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

↑