✦ LIBER ✦

Small order graph-tree Ramsey numbers

✍ Scribed by R.J. Faudree; C.C. Rousseau; R.H. Schelp

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 521 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90200-2

No coin nor oath required. For personal study only.

✦ Synopsis

With but a few exceptions, the Ramsey number r(G, T) is determined for all connected graphs G with at most five vertices and all trees T.

📜 SIMILAR VOLUMES

Tree-complete graph ramsey numbers

✍ V. Chvátal 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB

## Abstract The ramsey number of any tree of order __m__ and the complete graph of order __n__ is 1 + (__m__ − 1)(__n__ − 1).

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

Extremal theory and bipartite graph-tree

Extremal theory and bipartite graph-tree Ramsey numbers

✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II

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

Ramsey numbers for sets of small graphs

✍ Holger Brandes; Heiko Harborth; Hans-Dietrich O.F. Gronau; Christian Schwahn 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 733 KB

The Ramsey number r=r(G1-GZ-...-G,,,,H1-Hz-...-Hn) denotes the smallest r such that every 2-coloring of the edges of the complete graph K, contains a subgraph Gi with all edges of one color, or a subgraph Hi with all edges of a second color. These Ramsey numbers are determined for all sets of graph