✦ LIBER ✦

Some small ramsey numbers

✍ Scribed by M. Clancy

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 82 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010117

No coin nor oath required. For personal study only.

✦ Synopsis

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 are listed for almost all of these pairs.

📜 SIMILAR VOLUMES

Some connected ramsey numbers

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

## Abstract A graph __G__ is co‐connected if both __G__ and its complement __Ḡ__ are connected and nontrivial. For two graphs __A__ and __B__, the connected Ramsey number __r__~c~(__A, B__) is the smallest integer __n__ such that there exists a co‐connected graph of order __n__, and if __G__ is a c

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

Diagonal Ramsey numbers for small graphs

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

Size Ramsey numbers for small-order grap

Size Ramsey numbers for small-order graphs

✍ 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

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

Planar Ramsey Numbers

✍ R. Steinberg; C.A. Tovey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

The planar Ramsey number \(P R(k, l)(k, l \geqslant 2)\) is the smallest integer \(n\) such that any planar graph on \(n\) vertices contains either a complete graph on \(k\) vertices or an independent set of size \(l\). We find exact values of \(P R(k, l)\) for all \(k\) and \(l\). Included is a pro