A Lower Bound for R(5,6)
Combinatorics
2023-10-27 v1
Abstract
The known lower bound for the the classical Ramsey number is improved from to . The method used to construct the graph is a simple variant of computational methods that have been previously used to construct Ramsey graphs. The new method uses the concurrent programming features of the {\em Go} programming language.
Keywords
Cite
@article{arxiv.2310.17099,
title = {A Lower Bound for R(5,6)},
author = {Geoffrey Exoo},
journal= {arXiv preprint arXiv:2310.17099},
year = {2023}
}