𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diagonal Ramsey numbers for small graphs

✍ Scribed by S. A. Burr


Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
430 KB
Volume
7
Category
Article
ISSN
0364-9024

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

On graphs with small Ramsey numbers
✍ A. V. Kostochka; V. RΓΆdl πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 88 KB

## Abstract Let __R__(__G__) denote the minimum integer __N__ such that for every bicoloring of the edges of __K~N~__, at least one of the monochromatic subgraphs contains __G__ as a subgraph. We show that for every positive integer __d__ and each Ξ³,0 < γ < 1, there exists __k__ = __k__(__d__,Ξ³) su

Irredundant ramsey numbers for graphs
✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 356 KB
CO-irredundant Ramsey numbers for graphs
✍ E. J. Cockayne; G. MacGillivray; J. Simmons πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 2 views
On irredundant Ramsey numbers for graphs
✍ Johannes H. Hattingh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 248 KB

## Abstract The irredundant Ramsey number __s(m, n)__ is the smallest p such that in every two‐coloring of the edges of __K~p~__ using colors red (__R__) and blue (__B__), either the blue graph contains an __m__‐element irredundant set or the red graph contains an __n__‐element irredundant set. We

Some small ramsey numbers
✍ M. Clancy πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 82 KB

## Abstract In previous work, the Ramsey numbers have been evaluated for all pairs of graphs with at most four points. In the present note, Ramsey numbers are tabulated for pairs __F__~1~, __F__~2~ of graphs where __F__~1~ has at most four points and __F__~2~ has exactly five points. Exact results