The heroic-family conjecture
Statement
A finite family of graphs is heroic if there exists a constant such that every -free graph has cochromatic number less than . A family is celebrated if some constant guarantees that every -free graph has a clique or stable set of size at least .
Heroic-family conjecture. A finite family of graphs is heroic if and only if it contains a complete multipartite graph, the complement of a complete multipartite graph, a forest, and the complement of a forest.
The four listed conditions are necessary for a finite family to be celebrated, and the source conjectures that they are also sufficient for being heroic. The conjecture is presented as open and is related to the Gyárfás–Sumner conjecture.
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.