We present data which, to the best of our knowledge, includes all known nontrivial values and bounds for specific graph, hypergraph and multicolor Ramsey numbers, where the avoided graphs are complete or complete without one edge. Many results pertaining to other more studied cases are also presented. We give references to all cited bounds and values, as well as to previous similar compilations. We do not attempt complete coverage of asymptotic behavior of Ramsey numbers, but concentrate on their specific values.
Department, Program, or Center
Computer Science (GCCIS)
S. Radziszowski, Small Ramsey numbers, Electronic Journal of Combinatorics, Dynamic Surveys, DS1 (2006).
RIT – Main Campus
Version #11 - the most recent version is located here: http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS1/versions
Preliminary version appeared as a technical report, Department of Computer Science, Rochester Institute of Technology, RIT-TR-93-008 (1993).
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2013.