Name
Abstract | ||
|---|---|---|
We prove—for sufficiently large n—the following conjecture of Faudree and Schelp: $$R{\left( {P_{n} ,P_{n} ,P_{n} } \right)} = \left\{ {\begin{array}{*{20}c}{{2n - 1{\kern 1pt} \;{\text{for}}\;{\text{odd}}\;n,}} \\ {{{\text{2n - 2}}\;{\text{for}}\;{\text{even}}\;n,}} \\ \end{array} } \right.$$, for the three-color Ramsey numbers of paths on n vertices. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s00493-007-0043-4 | Combinatorica |
Keywords | DocType | Volume |
three-color ramsey numbers,three-color ramsey number,n vertex,following conjecture,large n,ramsey number | Journal | 27 |
Issue | ISSN | Citations |
1 | 0209-9683 | 34 |
PageRank | References | Authors |
18.19 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| András Gyárfás | 1 | 582 | 102.26 |
| M. Ruszinkó | 2 | 230 | 35.16 |
| Gábor N. Sárközy | 3 | 543 | 69.69 |
| Endre Szemerédi | 4 | 2102 | 363.27 |