Ramsey numbers for sets of small graphs

AbstractThe Ramsey number r=r(G1-G2-⋯-Gm,H1-H2-⋯-Hn) denotes the smallest r such that every 2-coloring of the edges of the complete graph Kr contains a subgraph Gi with all edges of one color, of a subgraph Hi with all edges of a second color. These Ramsey numbers are determined for all sets of graphs with at most four vertices, and in the diagonal case (m=n,Gi=Hi) for all pairs of graphs, one with at most four and the other with five vertices, so as for all sets of graphs with five vertices