The colourful induced-subgraph conjecture for forests
Statement
Let be a finite simple graph. For a vertex , write , and call -colourful if
for every . For an induced subgraph of , use the same definition with in place of . Colourful induced-subgraph conjecture. For every and every forest , there exists such that every -free graph has an -colourful induced subgraph with . This asserts the existence of a locally dense induced subgraph carrying a linear proportion of the chromatic number. It is known for and for stars, but the source says it is undecided for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.