✦ LIBER ✦

Ramsey numbers for multiple copies of complete graphs

✍ Scribed by P. J. Lorimer; R. J. Segedin

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 107 KB
Volume: 2
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190020112

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On zero sum Ramsey numbers: Multiple cop

On zero sum Ramsey numbers: Multiple copies of a graph

✍ A. Bialostocki; P. Dierker 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 1 views

## Abstract As a consequence of our main result, a theorem of Schrijver and Seymour that determines the zero sum Ramsey numbers for the family of all __r__‐hypertrees on __m__ edges and a theorem of Bialostocki and Dierker that determines the zero sum Ramsey numbers for __r__‐hypermatchings are com

Fan-complete graph Ramsey numbers

✍ Li, Yusheng; Rousseau, Cecil C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB 👁 2 views

It is shown that if G and H are arbitrary fixed graphs and n is sufficiently large, then Also, we prove that r ( K 1 +F, K,) 5 (m+o(l))&(n -+ GO) for any forest Fwhose largest component has m edges. Thus r(Fe, K,) 5 (1 + o(l))&, where Fe = K1 + CK2. We conjecture that r(Fe, K,) -&(n + cm).

Tree-complete graph ramsey numbers

✍ V. Chvátal 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB

## Abstract The ramsey number of any tree of order __m__ and the complete graph of order __n__ is 1 + (__m__ − 1)(__n__ − 1).

Local and meank-Ramsey numbers for compl

Local and meank-Ramsey numbers for complete graphs

✍ Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 2 views

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.

On Book-Complete Graph Ramsey Numbers

✍ Yusheng Li; C.C. Rousseau 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 274 KB

It is shown that a graph of order N and average degree d that does not contain the book B m =K 1 +K 1, m as a subgraph has independence number at least Nf (d ), where f (x)t(log xÂx) (x Ä ). From this result we find that the book-complete graph Ramsey number satisfies r(B m , K n ) mn 2 Âlog(nÂe). I

On Canonical Ramsey Numbers for Complete

On Canonical Ramsey Numbers for Complete Graphs versus Paths

✍ H. Lefmann; V. Rodl 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 405 KB