ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a forest, and let a graph be TT-free if it has no induced subgraph isomorphic to TT. A hereditary graph class is chi-bounded if there is a function f:N→Nf:\mathbb{N}\to\mathbb{N} such that every graph GG in the class and every induced subgraph HH of GG satisfy χ(H)⩽f(ω(H))\chi(H)\leqslant f(\omega(H)), where χ(H)\chi(H) is the chromatic number and ω(H)\omega(H) is the clique number. Gyárfás–Sumner conjecture. For every forest TT, the class of TT-free graphs is chi-bounded. The conjecture was disproved by Briański, Davies, and Walczak, who constructed chi-bounded classes that are not polynomially chi-bounded.

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.