Title of article
Stability of the path–path Ramsey number
Author/Authors
Gyلrfلs، نويسنده , , Andrلs and Sلrkِzy، نويسنده , , Gلbor N. and Szemerédi، نويسنده , , Endre، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
6
From page
4590
To page
4595
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 K n we can either find a monochromatic path substantially longer than 2 n / 3 , or the coloring is close to the extremal coloring.
Keywords
Ramsey Theory , stability , PATH
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598970
Link To Document