A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Small minimal (3, 3)-Ramsey graphs
[article]
2016
arXiv
pre-print
We say that G is a (3, 3)-Ramsey graph if every 2-coloring of the edges of G forces a monochromatic triangle. The (3, 3)-Ramsey graph G is minimal if G does not contain a proper (3, 3)-Ramsey subgraph. In this work we find all minimal (3, 3)-Ramsey graphs with up to 13 vertices with the help of a computer, and we obtain some new results for these graphs. We also obtain new upper bounds on the independence number and new lower bounds on the minimum degree of arbitrary (3, 3)-Ramsey graphs.
arXiv:1604.03716v1
fatcat:j4v5x4mb6nev7gykuoswpj5xwe