Small Ramsey Numbers
The Electronic Journal of Combinatorics2011Vol. 1000
Citations Over TimeTop 1% of 2011 papers
Abstract
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.
Related Papers
- → All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)(2019)52 cited
- → Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs(2020)31 cited
- → Overture: Ramsey’s Theorem(2011)
- → On induced Ramsey numbers fork-uniform hypergraphs(2015)
- → Anti-Ramsey numbers of paths and cycles in hypergraphs(2019)