ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a forest, and let GG be an HH-free graph, meaning that GG has no induced subgraph isomorphic to HH. Write χ(G)\chi(G) for its chromatic number and ω(G)\omega(G) for its clique number. Polynomial χ-bound conjecture for forest-free graphs. There exists a constant c>0c>0, depending on HH, such that

χ(G)≤ω(G)c\chi(G)\leq \omega(G)^c

for every HH-free graph GG. This conjecture is presented as a consequence of combining the Gyárfás–Sumner conjecture with Esperet's conjecture; the supplied text does not state whether it has been resolved.

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.