𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path Ramsey numbers in multicolorings

✍ Scribed by R.J Faudree; R.H Schelp

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
619 KB
Volume
19
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path-cycle Ramsey numbers
Path-cycle Ramsey numbers
✍ R.J. Faudree; S.L. Lawrence; T.D. Parsons; R.H. Schelp 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 1000 KB

I Retaefltiy, Ramsey numbers have been obtained for several &sses of graphs. In particthey have been studied for hs of low wder, pairs of paths, paks of cycles, and for a . In this paper, th rs atie obtained fair aI3 pa&cycle pairs,

Path-Star Ramsey numbers
Path-Star Ramsey numbers
✍ T.D Parsons 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 373 KB
Tripartite Ramsey numbers for paths
Tripartite Ramsey numbers for paths
✍ András Gyárfás; Miklós Ruszinkó; Gábor N. Sárközy; Endre Szemerédi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

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

Multicolor bipartite Ramsey number of C4
Multicolor bipartite Ramsey number of C4 and large Kn, n
✍ Qizhong Lin; Yusheng Li 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

Let br k (C 4 ; K n,n ) be the smallest N such that if all edges of K N,N are colored by k +1 colors, then there is a monochromatic C 4 in one of the first k colors or a monochromatic K n,n in the last color. It is shown that br k (C 4 ; K n,n ) = (n 2 / log 2 n) for k ≥ 3, and br 2 (C 4 ; K n,n ) ≥