✦ LIBER ✦

On Canonical Ramsey Numbers for Complete Graphs versus Paths

✍ Scribed by H. Lefmann; V. Rodl

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 405 KB
Volume: 58
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On ramsey numbers of forests versus near

On ramsey numbers of forests versus nearly complete graphs

✍ Gary Chartrand; Ronald J. Gould; Albert D. Polimeni 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 1 views

## Abstract A formula is presented for the ramsey number of any forest of order at least 3 versus any graph __G__ of order __n__ ≥ 4 having clique number __n__ ‐ 1. In particular, if __T__ is a tree of order __m__ ≥ 3, then __r(T, G)__ = 1 + (__m__ ‐ 1)(__n__ ‐ 2).

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

The ramsey numbers for stripes and one c

The ramsey numbers for stripes and one complete graph

✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 1 views

The Ramsey numbers M,,, n,P,, ..., n,P,), p > 2, are calculated. ## 1. Introduction One class of generalized Ramsey numbers that are known exactly are those for the graphs nP2 which consist of n disjoint paths of length 2; E. J. Cockayne and the author proved in 111 that d r(nlp2, ..., n d P 2 ) =

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.

Ramsey numbers for multiple copies of co

Ramsey numbers for multiple copies of complete graphs

✍ P. J. Lorimer; R. J. Segedin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

On irredundant Ramsey numbers for graphs

✍ Johannes H. Hattingh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every two‐coloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. We