✦ LIBER ✦

Size Ramsey numbers for small-order graphs

✍ Scribed by R. J. Faudree; J. Sheehan

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 108 KB
Volume: 7
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190070107

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Diagonal Ramsey numbers for small graphs

✍ S. A. Burr 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB

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

All triangle-graph ramsey numbers for co

All triangle-graph ramsey numbers for connected graphs of order six

✍ R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

## Abstract The Ramsey numbers __r(K__~3′~ __G__) are determined for all connected graphs __G__ of order six.

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