Gyárfás–Sumner conjecture on chi-bounded forest-free graphs
Statement
Let be a forest, and let a graph be -free if it has no induced subgraph isomorphic to . A hereditary graph class is chi-bounded if there is a function such that every graph in the class and every induced subgraph of satisfy , where is the chromatic number and is the clique number. Gyárfás–Sumner conjecture. For every forest , the class of -free graphs is chi-bounded. The conjecture was disproved by Briański, Davies, and Walczak, who constructed chi-bounded classes that are not polynomially chi-bounded.
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.