Let F be a fixed graph. The rainbow Turan number of F is defined as the maximum number of edges in a graph on n vertices that has a proper edge-coloring with no rainbow copy of F (i.e., a copy of F all of whose edges have different colours). The systematic study of such problems was initiated by Keevash, Mubayi, Sudakov and Verstraete.

In this paper, we show that the rainbow Turan number of a path with k + 1 edges is less than (9k/7 + 2) n, improving an earlier estimate of Johnston, Palmer and Sarkar.