The Ramsey number R(G,H) of two graphs G and H is the smallest integer r such that every graph F with at least r vertices contains G as a subgraph, or the complement of F contains H as a subgraph. A graph which does not contain G and whose complement does not contain H is called a Ramsey graph for (G,H).
This page contains all Ramsey numbers R(K3,G) for graphs of order 10. More information about how these Ramsey numbers were computed can be found in . All Ramsey graphs which were constructed in  can be downloaded from the searchable database of graphs by searching for the keywords 'ramsey * order 10'.
For a good overview of the results and bounds of Ramsey numbers which are currently known, see Radziszowski's dynamic survey .
More lists of Ramsey graphs can be found at:
All graph lists on this page are currently only available in 'graph6' format. The larger files are compressed with gzip.
|31||16 + ?|
|36||8 + ?|
 G. Brinkmann, J. Goedgebeur and J.C. Schlage-Puchta, Ramsey numbers R(K3,G) for graphs of order 10, Electronic Journal of Combinatorics, 19(4), 2012.
 S.P. Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics, Dynamic Survey 1, revision 13, 2011.