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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Network spreading among areas: A dynamical complex network modeling approach;Chaos: An Interdisciplinary Journal of Nonlinear Science;2022-10
2. Ramsey Numbers of Trails;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01
3. Gallai–Ramsey number for K5 ${K}_{5}$;Journal of Graph Theory;2022-04-15
4. Lower bounds for Ramsey numbers as a statistical physics problem;Journal of Statistical Mechanics: Theory and Experiment;2022-03-01
5. On Ramsey Numbers for Arbitrary Sequences of Graphs;Doklady Mathematics;2022-02