𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path-cycle Ramsey numbers

✍ Scribed by R.J. Faudree; S.L. Lawrence; T.D. Parsons; R.H. Schelp

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
1000 KB
Volume
10
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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,

📜 SIMILAR VOLUMES

Path-Star Ramsey numbers
Path-Star Ramsey numbers
✍ T.D Parsons 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 373 KB
Path and cycle sub-ramsey numbers and an
Path and cycle sub-ramsey numbers and an edge-colouring conjecture
✍ Geňa Hahn; Carsten Thomassen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We show the existence of a constant c such that if n >I ck 3 and the edges of K,, are coloured using no colour more than k times then there is a Hamilton path with all edges of distinct colours. From this we infer that sr(Pn, k) = sr(Cn, k) = n, whenever n >t ck 3. We follow for notation and termi

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

On cycle—Complete graph ramsey numbers
On cycle—Complete graph ramsey numbers
✍ P. Erdös; R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

A new upper bound is given for the cycle-complete graph Ramsey number r(Cm, K,,), the smallest order for a graph which forces it to contain either a cycle of order m or a set of n independent vertices. Then, another cycle-complete graph Ramsey number is studied, namely r(sCm, K,) the smallest order

Multipartite Ramsey numbers for odd cycl
Multipartite Ramsey numbers for odd cycles
✍ András Gyárfás; Gábor N. Sárközy; Richard H. Schelp 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## Abstract In this paper we study multipartite Ramsey numbers for odd cycles. We formulate the following conjecture: Let __n__≥5 be an arbitrary positive odd integer; then, in any two‐coloring of the edges of the complete 5‐partite graph __K__((__n__−1)/2, (__n__−1)/2, (__n__−1)/2, (__n__−1)/2, 1)