ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let χ(G)\chi(G) denote its chromatic number, i.e. the least number of colours in a proper vertex colouring of GG. For graphs HH and GG, say that GG is HH-free if no induced subgraph of GG is isomorphic to HH; here an induced subgraph of GG is a graph G[S]G[S] with S⊆V(G)S \subseteq V(G), having vertex set SS and all edges of GG with both ends in SS. Let KtK_t denote the complete graph on tt vertices, and let a tree be a finite connected acyclic graph.

For every tree TT and every integer t≥1t \ge 1 there exists a constant c(T,t)c(T,t) such that

χ(G)≤c(T,t)\chi(G) \le c(T,t)

for every graph GG that is both TT-free and KtK_t-free.

Equivalently: for every tree TT and every integer t≥1t \ge 1 there exists kk such that every KtK_t-free graph GG with χ(G)≥k\chi(G) \ge k contains TT as an induced subgraph.

Record

Added
Links

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.