## Abstract We prove that for all ε>0 there are α>0 and __n__~0~∈ℕ such that for all __n__⩾__n__~0~ the following holds. For any two‐coloring of the edges of __K__~__n, n, n__~ one color contains copies of all trees __T__ of order __t__⩽(3 − ε)__n__/2 and with maximum degree Δ(__T__)⩽__n__^α^. This
Tripartite Ramsey numbers for paths
✍ Scribed by András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 137 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
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))2__n__. Since R(P~2__n__+1~,P~2__n__+1~)=3__n__, this means that the length of the longest monochromatic path is about the same when two‐colorings of K~3__n__~ and K(n, n, n) are considered. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 164–174, 2007
📜 SIMILAR VOLUMES
For n = 1, 2, . . . , let 6, = K2+ K,,. We pose the problem of determining the Ramsey numbers r(&, B,) and demonstrate that in many cases critical colorings are available from known examples of strongly regular graphs.