𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Remarks on the size Ramsey number of graphs

✍ Scribed by H. Bielak


Publisher
Springer Netherlands
Year
1987
Tongue
English
Weight
579 KB
Volume
18
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Size Ramsey numbers for small-order grap
✍ R. J. Faudree; J. Sheehan πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

A table of the size Ramsey number or the restricted size Rarnsey number for all pairs of graphs with at most four vertices and no isolated vertices is given. Let F, G, and H be finite, simple, and undirected graphs. The number of vertices and edges of a graph F are denoted byp(F) and q(F), respecti

The size Ramsey number of a complete bip
✍ 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".

The size Ramsey number
✍ P. ErdΕ‘s; R. J. Faudree; C. C. Rousseau; R. H. Schelp πŸ“‚ Article πŸ“… 1978 πŸ› Springer Netherlands 🌐 English βš– 899 KB
On Geometric Graph Ramsey Numbers
✍ Gyula KΓ‘rolyi; Vera Rosta πŸ“‚ Article πŸ“… 2009 πŸ› Springer Japan 🌐 English βš– 179 KB
On Pattern Ramsey Numbers of Graphs
✍ Robert E. Jamison; Douglas B. West πŸ“‚ Article πŸ“… 2004 πŸ› Springer Japan 🌐 English βš– 252 KB