New upper and lower bounds for Ramsey numbers
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)\).
scientific article; zbMATH DE number 1567140