ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple graph. For a vertex v∈V(G)v\in V(G), write NG[v]=NG(v)∪{v}N_G[v]=N_G(v)\cup\{v\}, and call GG ε\varepsilon-colourful if

χ(G∖NG[v])<εχ(G)\chi(G\setminus N_G[v])<\varepsilon\chi(G)

for every v∈V(G)v\in V(G). For an induced subgraph FF of GG, use the same definition with FF in place of GG. Colourful induced-subgraph conjecture. For every ε>0\varepsilon>0 and every forest TT, there exists δ>0\delta>0 such that every TT-free graph GG has an ε\varepsilon-colourful induced subgraph FF with χ(F)≥δχ(G)\chi(F)\ge\delta\chi(G). This asserts the existence of a locally dense induced subgraph carrying a linear proportion of the chromatic number. It is known for T=P4T=P_4 and for stars, but the source says it is undecided for T=P5T=P_5 and even for the two-edge matching.

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.