Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems

Given integers ℓ,n, the ℓth power of the path Pn is the ordered graph Pnℓ with vertex set v11, Balko-Cibulka-Král-Kynčl proved that r(Pnℓ,Pnℓ)