  We apply Ramsey theoretic tools to show that there is a family of graphs
which have tree-chromatic number at most~$2$ while the path-chromatic number is
unbounded. This resolves a problem posed by Seymour.
