𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Ramsey numbers for stripes and complete graphs 1

✍ Scribed by P.J. Lorimer; W. Solomon

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
426 KB
Volume
104
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Irredundant ramsey numbers for graphs
Irredundant ramsey numbers for graphs
✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 356 KB
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".