๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by R. J. Faudree; C. C. Rousseau; R. H. Schelp

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
356 KB
Volume
4
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

The Ramsey numbers r(K~3โ€ฒ~ G) are determined for all connected graphs G of order six.

๐Ÿ“œ SIMILAR VOLUMES

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

Bounds for the ramsey number of a discon
Bounds for the ramsey number of a disconnected graph versus any graph
โœ Ronald J. Gould; Michael S. Jacobson ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 200 KB ๐Ÿ‘ 1 views

## Abstract Bounds are determined for the Ramsey number of the union of graphs versus a fixed graph __H__, based on the Ramsey number of the components versus __H__. For certain unions of graphs, the exact Ramsey number is determined. From these formulas, some new Ramsey numbers are indicated. In p

New Lower Bounds for Ramsey Numbers of G
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
โœ Felix Lazebnik; Dhruv Mubayi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 146 KB ๐Ÿ‘ 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,