The Ramsey number R(k; l) is the least integer n such that all graphs on n or more vertices contain a clique of k vertices or an independent set of l vertices as an induced subgraph. In this work we investigate computational methods for finding lower bounds for Ramsey numbers. Some constructions of lower bounds for multicolor Ramsey numbers, a… (More)

### Presentations referencing similar topics