A note on Ramsey numbers with two parameters (Q2368714): Difference between revisions

The Ramsey number \(R(G_1,G_2)\) is the smallest integer \(n\) such that for every graph \(G\) on \(n\) vertices, either \(G\) contains \(G_1\), or otherwise, \(\overline{G}\) (i.e., the complement of \(G\)) contains \(G_2\). Of special interest are Ramsey numbers where the graphs \(G_1\) and \(G_2\) are \(K_n - e\) (i.e., \(K_n\) with one edge deleted) and \(K_m\) respectively. In the paper under review it is shown for example that \(R(K_6-e,K_6)\leq 116\) and \(R(K_6-e,K_7)\leq 202\), which improves the upper bounds for these two classical Ramsey numbers.