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 Kn we can either find a monochromatic path substantially longer than 2n=3, or the coloring is close to the extremal coloring.
, Sárközy, Gábor N.
, Szemerédi, Endre
(2008). Stability of the path-path Ramsey number. .
Retrieved from: http://digitalcommons.wpi.edu/computerscience-pubs/32