𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs

✍ Scribed by Tao Jiang; Michael Salerno

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
147 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The size Ramsey number of a complete bip
The size Ramsey number of a complete bipartite graph
✍ P. Erdo˝s; C.C. Rousseau πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 240 KB

Erd6s. P. and C.C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Mathematics 113 (1993) 259-262. In this note we prove that the (diagonal) size Ramsey number of K,,.,, is bounded below by $2'2".

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).