Polynomial χ-bounds for forest-free graphs
Statement
Let be a forest, and let be an -free graph, meaning that has no induced subgraph isomorphic to . Write for its chromatic number and for its clique number. Polynomial χ-bound conjecture for forest-free graphs. There exists a constant , depending on , such that
for every -free graph . This conjecture is presented as a consequence of combining the Gyárfás–Sumner conjecture with Esperet's conjecture; the supplied text does not state whether it has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.