𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers

✍ Scribed by Yair Caro; Yusheng Li; Cecil C. Rousseau; Yuming Zhang

Book ID
108316457
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
77 KB
Volume
220
Category
Article
ISSN
0012-365X

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 bounds for size Ramsey numbers of a c
On bounds for size Ramsey numbers of a complete tripartite graph
✍ Izolda Gorgol πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 146 KB

It will be shown that the (diagonal) size Ramsey number of K ..... is bounded below by c. 64n , 2 3oj2 ~n 2 and above by 2 Let F and G be graphs. The symbol F >---,G denotes that in any two-colouring (say red and blue) of edges of F a monochromatic copy of G is contained. The Ramsey number r(G) is t