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

关于$χ$ -有界性的综述

A survey of $χ$-boundedness

Alex Scott, Paul Seymour

摘要:

如果一个图的团数有界,且色数足够大,那么它的诱导子图是什么?安德拉什·捷尔法斯在20世纪80年代初对此提出了一些具有挑战性的建议,这些建议直到最近才公开;但在过去几年里,已经取得了实质性的进展。这是一个关于我们现在所处位置的调查。

英文摘要:

If a graph has bounded clique number, and sufficiently large chromatic number, what can we say about its induced subgraphs? András Gyárfás made a number of challenging conjectures about this in the early 1980's, which have remained open until recently; but in the last few years there has been substantial progress. This is a survey of where we are now.

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

↑