✦ LIBER ✦

On Ramsey numbers for linear forests

✍ Scribed by Stefan A. Burr; John A. Roberts

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 372 KB
Volume: 8
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90136-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey numbers for all linear forests

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

## RAMSEY NUMBERS FOR ALL LINEAR FORESTS l'hls dnwwr\ m the rltfirmdire d ccrnjccture of Burr and Roberts. I. Introduction , C3vcn graphs If and K, the Ramsey number r(H. K) is the sm:tllest positive integer p such that any graph G on p vertices contains H as a subgraph or its complenrcr!? c conta

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 graphs with linear Ramsey numbers

✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

On ramsey numbers for books

✍ C. C. Rousseau; J. Sheehan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

For n = 1, 2, . . . , let 6, = K2+ K,,. We pose the problem of determining the Ramsey numbers r(&, B,) and demonstrate that in many cases critical colorings are available from known examples of strongly regular graphs.

On Ramsey numbers for circuits

✍ H.L Abbott 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Subdivided graphs have linear ramsey num

Subdivided graphs have linear ramsey numbers

✍ Noga Alon 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

## Abstract It is shown that the Ramsey number of any graph with __n__ vertices in which no two vertices of degree at least 3 are adjacent is at most 12__n__. In particular, the above estimate holds for the Ramsey number of any __n__‐vertex subdivision of an arbitrary graph, provided each edge of t