ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A finite family H\mathcal{H} of graphs is heroic if there exists 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 family is celebrated if some constant 0<c(H)≤10<c(\mathcal{H})\leq 1 guarantees that every H\mathcal{H}-free graph has a clique or stable set of size at least c(H)∣V(G)∣c(\mathcal{H})|V(G)|.

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 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.