𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


The tripartite Ramsey number for trees
✍ Julia Böttcher; Jan Hladký; Diana Piguet 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## 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

Ramsey Numbers for Matroids
✍ Talmage James Reid 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 233 KB
Irredundant ramsey numbers for graphs
✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB
On ramsey numbers for books
✍ C. C. Rousseau; J. Sheehan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

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.

CO-irredundant Ramsey numbers for graphs
✍ E. J. Cockayne; G. MacGillivray; J. Simmons 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views