Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths

Alex Scott, Paul Seymour


We prove that for all integers $\kappa, s\ge 0$ there exists $c$ with the following property. Let $G$ be a graph with clique number at most $\kappa$ and chromatic number more than $c$. Then for every vertex-colouring (not necessarily optimal) of $G$, some induced subgraph of $G$ is an $s$-vertex path, and all its vertices have different colours. This extends a recent result of Gyárfás and Sárközy (2016) who proved the same for graphs $G$ with $\kappa=2$ and girth at least five.


Colouring; Rainbow

Full Text: