The Erdős–Hajnal conjecture for paths and antipaths

We prove that for every k  , there exists ck>0ck>0 such that every graph G on n   vertices with no induced path PkPk or its complement Pk¯ contains a clique or a stable set of size ncknck.