ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A heroic family of graphs is one for which there is a constant d(H)>0d(\mathcal{H})>0 such that every H\mathcal{H}-free graph has cochromatic number less than d(H)d(\mathcal{H}). A complete graph is denoted by KK, and a tree by TT.

Gyárfás–Sumner conjecture. For every complete graph KK and every tree TT, the family {K,T}\{K,T\} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.