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
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
## 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
## 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
## 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