Ramsey(3,4) graphs
Last update: 20 Dec 2019 | Contains: 48 graphs
A Ramsey(s,t) graph is a graph with no clique of size s, and no independent set of size t. The following collection was calculated by Brendan McKay (source) and lists all Ramsey(3,4) graphs.