Document Type

Other

Publication Date

9-12-2008

Abstract

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.

DOI

WPI-CS-TR-08-12

Share

 
COinS