An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G
Alexander Sidorenko · Journal of Graph Theory · 1991
Abstract Harary stated the conjecture that for any graph G with n edges and without isolated vertices r(K3,G) ⩽ 2n + 1. Erdös, Faudree, Rousseau, and Schelp proved that r(K3,G) ⩽ ⌈8/3n⌉. Here we prove that r(K3,G) ⩽ ⌊5/2n⌋ −1 for n > 3.