New Lower Bounds for 28 Classical Ramsey Numbers
Combinatorics
2015-07-21 v3
Abstract
We establish new lower bounds for classical two and three color Ramsey numbers, and describe the heuristic search procedures we used. Several of the new three color bounds are derived from the two color constructions; specifically, we were able to use -colorings to obtain new -colorings, and -colorings to obtain new -colorings. Some of the other new constructions in the paper are derived from two well-known colorings: the Paley coloring of and the cubic coloring of .
Keywords
Cite
@article{arxiv.1504.02403,
title = {New Lower Bounds for 28 Classical Ramsey Numbers},
author = {Geoffrey Exoo and Milos Tatarevic},
journal= {arXiv preprint arXiv:1504.02403},
year = {2015}
}