Description
We discuss some computational challenges and related open questions concerning classical Ramsey numbers. This talk overviews known constructive bounds for the difference between consecutive Ramsey numbers and presents what is known about the most studied cases including $R(5,5)$ and $R(3,3,4)$. Although the main problems we discuss are concerned with concrete cases, and they involve significant computational approaches, there are interesting and important theoretical questions behind each of them.
Date of creation, presentation, or exhibit
8-31-2015
Document Type
Presentation
Department, Program, or Center
Computer Science (GCCIS)
Recommended Citation
Radziszowski, Stanislaw P., "Some Computational and Theoretical Problems for Ramsey Numbers" (2015). Accessed from
https://repository.rit.edu/other/832
Campus
RIT – Main Campus
COinS
