The Gyárfás–Sumner heroic-family conjecture
Statement
A heroic family of graphs is one for which there is a constant such that every -free graph has cochromatic number less than . A complete graph is denoted by , and a tree by .
Gyárfás–Sumner conjecture. For every complete graph and every tree , the family is heroic.
The source says this conjecture was made independently by Gyárfás and Sumner and is equivalent to the broader finite heroic-family conjecture above. It remains open in the generality stated.
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.