A computerised classification of some almost minimal triangle-free Ramsey graphs

Oliver Krüger

A graph $G$ is called a $(3,j;n)$-minimal Ramsey graph if it has the least amount of edges, $e(3,j;n)$, given that $G$ is triangle-free, the independence number $\alpha (G)<j$ and that…