The third Ramsey numbers for graphs with at most four edges
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.
scientific article; zbMATH DE number 562685