Path-Star 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 Ramsey numbers in multicolorings

✍ R.J Faudree; R.H Schelp 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 619 KB

More star sub-ramsey numbers

✍ Geňa Hahn 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 841 KB

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

Size Ramsey numbers involving stars

✍ R.J. Faudree; J. Sheehan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 302 KB

We calculate some size Ramsey numbers involving stars. For example we prove that for t ~ k w2 ~md n sufficiently large the size Ramsey number r,, (K,,k All graphs in this paper are finite, simple and undirected. Let F, C and H be graphs. The number of vertices and edges of a graph F will be denoted

A result on C4-star Ramsey numbers

✍ Guantao Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 140 KB

In this paper, we will show that the Ramsey number r(C4,Ki,n+l)<~r(C4,Ki,n)+ 2 for all positive integers n. This result answers a question proposed by Burr, Erd6s, Faudree, Rousseau, and Schelp.