  The following relaxation of the classical problem of determining Ramsey
number of a fixed graph has first been proposed by Erdos, Hajnal and Rado over
50 years ago. Given a graph $G$ and an integer $t \geq 2$ determine the minimum
number $N$ such that in any $t$-coloured complete graph on $N$ vertices there
is a copy of $G$ using only edges of some $t-1$ colours. We determine the
answer precisely when $G$ is a path.
