Gyárfás's infinite 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 . Let be a complete graph and let be a positive integer; the family in question consists of and all cycles of length at least .
Gyárfás's infinite-family conjecture. For every complete graph , and every integer , the family consisting of and all cycles of length at least is heroic.
Unlike the finite-family conjecture, this concerns an infinite family and the source notes that the situation is more complicated. It is stated as an open conjecture of Gyárfás.
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.