
The Ramsey number \(R(G_1, G_2)\) is the smallest integer \(p\) such that for any graph \(G\) on \(p\) vertices either \(G\) contains the graph \(G_1\) or the complement \(\overline G\) of \(G\) contains the graph \(G_2\). The paper presents some new upper and lower bound formulas for \(R(G_1,G_2)\) and \(R(K_m, K_n)\).
Computational Theory and Mathematics, Ramsey number, Generalized Ramsey theory, Ramsey graph, Geometry and Topology, bound formulas, Theoretical Computer Science
Computational Theory and Mathematics, Ramsey number, Generalized Ramsey theory, Ramsey graph, Geometry and Topology, bound formulas, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
