The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1

We prove Harary′s conjecture that for any graph G with n edges and without isolated vertices r(K3, G) ≤ 2n + 1.