< Back to previous view
Sign in

Ramsey(3,5) graphs

Last update: 20 Dec 2019  | Contains: 1029 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,5) graphs.

Collection comments

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here