Name
Abstract | ||
|---|---|---|
In this article, we study the tripartite Ramsey numbers of paths. We show that in any two-coloring of the edges of the complete tripartite graph K(n, n, n) there is a monochromatic path of length (1 - o(1))2n. Since R(P2n+1,P2n+1)=3n, this means that the length of the longest monochromatic path is about the same when two-colorings of K3n and K(n, n, n) are considered. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 164–174, 2007 |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/jgt.v55:2 | Journal of Graph Theory |
Keywords | Field | DocType |
ramsey number,ramsey numbers | Graph theory,Discrete mathematics,Graph,Combinatorics,Monochromatic color,Ramsey's theorem,Mathematics | Journal |
Volume | Issue | ISSN |
55 | 2 | 0364-9024 |
Citations | PageRank | References |
13 | 0.96 | 2 |
Authors | ||
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 |