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.

中文翻译：

---

χ 有界的调查

如果一个图有有界团数和足够大的色数，我们可以说它的诱导子图是什么？安德拉斯·贾法斯 (András Gyárfás) 在 1980 年代初期对此提出了许多具有挑战性的猜想，直到最近这些猜想仍然开放。但在过去几年中取得了重大进展。这是对我们现在所处位置的调查。