Stability of the path–path Ramsey number

Here we prove a stability version of a Ramsey-type Theorem for paths. Thus in any 2-coloring of the edges of the complete graph KnKn we can either find a monochromatic path substantially longer than 2n/32n/3, or the coloring is close to the extremal coloring.