The third Ramsey numbers for graphs with at most four edges
type: Item
instance of: scholarly article
title: The third Ramsey numbers for graphs with at most four edges
zbMATH Open document ID: 0795.05097
DOI: 10.1016/0012-365X(94)90182-1
author: Yuansheng Yang
author: P. Rowlinson
published in: Discrete Mathematics
publication date: 1994-06-09T00:00:00Z
review text: Given a graph \(H\) and a positive integer \(n\), the Ramsey number \(r_ n (H)\) is defined to be the least integer \(p\) such that given any edge \(n\)- coloring of the complete graph on \(p\) vertices, \(K_ p\), there will always be a monochromatic copy of \(H\) in \(K_ p\). Using a computer, the authors have evaluated \(r_ 3 (H)\) for all 19 of the graphs on at most four edges which admit no isolated vertices.
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 562685
zbMATH Keywords: Ramsey number
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Diagonal Ramsey numbers for small graphs
cites work: Q4044600
cites work: The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\)
cites work: The Ramsey number for stripes
cites work: Combinatorial Relations and Chromatic Graphs
cites work: Q4017046
cites work: Q4282930
description: scientific article; zbMATH DE number 562685