✦ LIBER ✦

A note on cycle Ramsey numbers

✍ Scribed by Gary Chartrand; Seymour Schuster

Book ID: 107748157
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 283 KB
Volume: 5
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90124-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on Ramsey numbers

✍ Miklós Ajtai; János Komlós; Endre Szemerédi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A note on restricted vertex ramsey numbe

A note on restricted vertex ramsey numbers

✍ Tomasz Luczak; Sebastian Urbański 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 158 KB

A note on Ramsey numbers for books

✍ Vladimir Nikiforov; Cecil C. Rousseau 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~ ⊂ __G__ or __B__~__n__~ ⊂ __G__ for every graph __G__ of order __r__

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,

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

A note on constructive methods for ramse

A note on constructive methods for ramsey numbers

✍ F. R. K. Chung 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB 👁 1 views

## Abstract Let __r(k__) denote the least integer __n__‐such that for any graph __G__ on __n__ vertices either __G__ or its complement G contains a complete graph __K__~k~ on __k__ vertices. in this paper, we prove the following lower bound for the Ramsey number __r(k__) by explicit construction: _