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}). Let KK be a complete graph and let tt be a positive integer; the family in question consists of KK and all cycles of length at least tt.

Gyárfás's infinite-family conjecture. For every complete graph KK, and every integer t>0t>0, the family consisting of KK and all cycles of length at least tt 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 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.