All Ramsey numbers for five vertices and seven or eight edges (Q1119943)

For a graph G, the (diagonal) Ramsey number r(G) is the least positive integer n so that every 2-coloring of the edges of \(K_ n\), the complete graph on n vertices, contains a copy of G with all of its edges assigned the same color. The author computes r(G) for five graphs. These graphs have 5 vertices and 7 or 8 edges and fills in the gap so that r(G) is now known for all proper subgraphs of \(K_ 5\) and \(K_ 5\) is now the simplest graph for which the corresponding Ramsey number is not known.