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 2 n / 3, or the coloring is close to the extremal coloring.
- Ramsey theory
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics