The narrowness conjecture for H-free graphs
Statement
Let be a graph. A function is good if, for every perfect induced subgraph of ,
For , the graph is -narrow if, for every good function ,
Narrowness conjecture. For every graph , there exists a constant such that every -free graph is -narrow.
Fox showed that this conjecture is equivalent to the Erdős–Hajnal conjecture. It is known for some classes, including bull-free graphs, but remains open for general -free graphs.
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.